Optimal Morphs of Planar Orthogonal Drawings II

by   Arthur van Goethem, et al.

Van Goethem and Verbeek recently showed how to morph between two planar orthogonal drawings Γ_I and Γ_O of a connected graph G while preserving planarity, orthogonality, and the complexity of the drawing during the morph. Necessarily drawings Γ_I and Γ_O must be equivalent, that is, there exists a homeomorphism of the plane that transforms Γ_I into Γ_O. 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 O(n^1.5) 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 spirality s = O(n) of Γ_I relative to Γ_O and describe a morph from Γ_I to Γ_O using O(s) linear morphs. We prove that s+1 linear morphs are always sufficient to morph between two planar orthogonal drawings, even for disconnected graphs. The resulting morphs are quite natural and visually pleasing.


page 1

page 2

page 3

page 4


Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time

A plane graph is rectilinear planar if it admits an embedding-preserving...

Optimal Morphs of Planar Orthogonal Drawings

We describe an algorithm that morphs between two planar orthogonal drawi...

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

While orthogonal drawings have a long history, smooth orthogonal drawing...

Morphing Planar Graph Drawings Through 3D

In this paper, we investigate crossing-free 3D morphs between planar str...

On Morphing 1-Planar Drawings

Computing a morph between two drawings of a graph is a classical problem...

Bijections between planar maps and planar linear normal λ-terms with connectivity condition

The enumeration of linear λ-terms has attracted quite some attention rec...

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings

A plus-contact representation of a planar graph G is called c-balanced i...

Please sign up or login with your details

Forgot password? Click here to reset