Optimal Morphs of Planar Orthogonal Drawings

Arthur van Goethem, Kevin Verbeek

We describe an algorithm that morphs between two planar orthogonal drawings ${\Gamma }_I$ and ${\Gamma }_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $Γ_I…