Optimal morphs of planar orthogonal drawings

We describe an algorithm that morphs between two planar orthogonal drawings ΓI and ΓO of a graph G, while preserving planarity and orthogonality. Necessarily drawings ΓI and ΓO must be equivalent, that is, there exists a homeomorphism of the plane that transforms ΓI into ΓO . Our morph uses a linear number of linear morphs (linear interpolations between two drawings) and preserves linear complexity throughout the process, thereby answering an open question from Biedl et al. (ACM Transactions on Algorithms, 2013). Our algorithm first unifies the two drawings to ensure an equal number of (virtual) bends on each edge. We then interpret bends as vertices which form obstacles for so-called wires: horizontal and vertical lines separating the vertices of ΓO . We can find corresponding wires in ΓI that share topological properties with the wires in ΓO . The structural difference between the two drawings can be captured by the spirality s of the wires in ΓI, which guides our morph from ΓI to ΓO . We prove that s = O(n) and that s + 1 linear morphs are always sufficient to morph between two planar orthogonal drawings, even for disconnected graphs.