Michael J. Spriggs

12 papers A* 1A 1B 2Journal 4Unranked 4
YearRankTypeTitle / Venue / Authors
2013 J jnl
Morphing orthogonal planar graph drawings.
ACM Trans. Algorithms
Therese Biedl, Anna Lubiw, Mark Petrick, Michael J. Spriggs
2009 J jnl
Morphing polyhedra with parallel faces: Counterexamples.
Comput. Geom.
Therese Biedl, Anna Lubiw, Michael J. Spriggs
2007 B conf
Cauchy's Theorem and Edge Lengths of Convex Polyhedra.
WADS
Therese Biedl, Anna Lubiw, Michael J. Spriggs
2006 A* conf
Morphing orthogonal planar graph drawings.
SODA
Anna Lubiw, Mark Petrick, Michael J. Spriggs
2005 A conf
Morphing Planar Graphs While Preserving Edge Directions.
GD
Therese Biedl, Anna Lubiw, Michael J. Spriggs
2005 — conf
Morphing Polyhedra Preserving Face Normals: A Counterexample.
CCCG
Therese Biedl, Anna Lubiw, Michael J. Spriggs
2004 B conf
Angles and Lengths in Reconfigurations of Polygons and Polyhedra.
MFCS
Therese Biedl, Anna Lubiw, Michael J. Spriggs
2004 J jnl
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.
Algorithmica
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
2003 — conf
Approximating the geometric minimum-diameter spanning tree.
CCCG
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
2003 — conf
Parallel morphing of trees and cycles.
CCCG
Therese Biedl, Anna Lubiw, Michael J. Spriggs
2002 J jnl
A new bound for map labeling with uniform circle pairs.
Inf. Process. Lett.
Michael J. Spriggs, J. Mark Keil
1999 — conf
Minimum spanning trees on polyhedra.
CCCG
Michael J. Spriggs, J. Mark Keil