Michael J. Spriggs

Publication Activity (10 Years)

Years Active: 1999-2013
Publications (10 Years): 0

Top Topics

Approximate Inference

Top Venues

ACM Trans. Algorithms

Publications

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