Morphing Planar Graph Drawings with Bent Edges (2008)
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial number of elementary...
Abstract Morphing Orthogonal Planar Graph Drawings ∗ (2008)
Anna Lubiw, Mark Petrick, Michael Spriggs
We give an algorithm to morph between two planar orthogonal drawings of a graph, preserving planarity and orthogonality. The morph uses a polynomial number of discrete steps. Each step is either a...