Search the dblp DataBase

Publications of Author

1. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
   Parallel morphing of trees and cycles. [Citation Graph (0, 0)][DBLP]
   CCCG, 2003, pp:29-34 [Conf]
   
2. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
   Morphing Polyhedra Preserving Face Normals: A Counterexample. [Citation Graph (0, 0)][DBLP]
   CCCG, 2005, pp:109-112 [Conf]
   
3. Michael J. Spriggs, J. Mark Keil
   Minimum spanning trees on polyhedra. [Citation Graph (0, 0)][DBLP]
   CCCG, 1999, pp:- [Conf]
   
4. Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
   Approximating the geometric minimum-diameter spanning tree. [Citation Graph (0, 0)][DBLP]
   CCCG, 2003, pp:39-42 [Conf]
   
5. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
   Morphing Planar Graphs While Preserving Edge Directions. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2005, pp:13-24 [Conf]
   
6. 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:748-759 [Conf]
   
7. Anna Lubiw, Mark Petrick, Michael J. Spriggs
   Morphing orthogonal planar graph drawings. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:222-230 [Conf]
   
8. Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
   Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2004, v:38, n:4, pp:577-589 [Journal]
   
9. 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:47-53 [Journal]
   
10. 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:398-409 [Conf]
    
11. 
    Morphing polyhedra with parallel faces: Counterexamples. [Citation Graph (, )][DBLP]