View article

Van Goethem and Verbeek [12] recently showed how to morph between two planar orthogonal drawings and of a connected graph G while preserving planarity, orthogonality, and the complexity of the drawing during the morph. Necessarily drawings and must be equivalent, that is, there exists a homeomorphism of the plane that transforms into . Van Goethem and Verbeek use O(n) linear morphs, where n is the maximum complexity of the input drawings. However, if the graph is disconnected their method requires linear morphs. In this paper we present a refined version of their approach that allows us to also morph between two planar orthogonal drawings of a disconnected graph with O(n) linear morphs while preserving planarity, orthogonality, and linear complexity of the intermediate drawings.

Van Goethem and Verbeek measure the structural difference between the two drawings in terms of the so-called …