
Search the dblp DataBase
Michael J. Spriggs:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
Parallel morphing of trees and cycles. [Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:2934 [Conf]
 Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
Morphing Polyhedra Preserving Face Normals: A Counterexample. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:109112 [Conf]
 Michael J. Spriggs, J. Mark Keil
Minimum spanning trees on polyhedra. [Citation Graph (0, 0)][DBLP] CCCG, 1999, pp: [Conf]
 Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
Approximating the geometric minimumdiameter spanning tree. [Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:3942 [Conf]
 Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
Morphing Planar Graphs While Preserving Edge Directions. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:1324 [Conf]
 Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
Angles and Lengths in Reconfigurations of Polygons and Polyhedra. [Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:748759 [Conf]
 Anna Lubiw, Mark Petrick, Michael J. Spriggs
Morphing orthogonal planar graph drawings. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:222230 [Conf]
 Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
Computing a (1+epsilon)Approximate Geometric MinimumDiameter Spanning Tree. [Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:38, n:4, pp:577589 [Journal]
 Michael J. Spriggs, J. Mark Keil
A new bound for map labeling with uniform circle pairs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:1, pp:4753 [Journal]
 Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
Cauchy's Theorem and Edge Lengths of Convex Polyhedra. [Citation Graph (0, 0)][DBLP] WADS, 2007, pp:398409 [Conf]
Morphing polyhedra with parallel faces: Counterexamples. [Citation Graph (, )][DBLP]
Search in 0.025secs, Finished in 0.026secs
