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...
Cauchy’s Theorem and Edge Lengths of Convex (2008)
Therese Biedl, Anna Lubiw, Michael Spriggs
Abstract. In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in...
Cauchy’s Theorem and Edge Lengths of Convex (2008)
Therese Biedl, Anna Lubiw, Michael Spriggs
Abstract. In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in...
Morphing Planar Graphs While Preserving Edge Directions (2006)
Biedl, Therese, Lubiw, Anna, Spriggs, Michael
Two straight-line drawings P,Q of a graph (V,E) are called parallel if, for every edge (u,v) in E, the vector from u to v has the same direction in both P and Q. We study problems of the form: given...
Morphing Planar Graphs While Preserving Edge Directions (2006)
Biedl, Therese, Lubiw, Anna, Spriggs, Michael
Two straight-line drawings P,Q of a graph (V,E) are called parallel if, for every edge (u,v) in E, the vector from u to v has the same direction in both P and Q. We study problems of the form: given...
Morphing Planar Graphs While Preserving Edge Directions (2006)
Biedl, Therese, Lubiw, Anna, Spriggs, Michael
Two straight-line drawings P,Q of a graph (V,E) are called parallel if, for every edge (u,v) in E, the vector from u to v has the same direction in both P and Q. We study problems of the form: given...