Michael J. Spriggs

Comput. Geom., 2009

2007

Cauchy's Theorem and Edge Lengths of Convex Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2006

Morphing orthogonal planar graph drawings.

[BibT_eX]

[DOI]

Mark Petrick

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Morphing Planar Graphs While Preserving Edge Directions.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Morphing Polyhedra Preserving Face Normals: A Counterexample.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.

[BibT_eX]

[DOI]

Algorithmica, 2004

Angles and Lengths in Reconfigurations of Polygons and Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

Approximating the geometric minimum-diameter spanning tree.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Parallel morphing of trees and cycles.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

A new bound for map labeling with uniform circle pairs.

[BibT_eX]

[DOI]

J. Mark Keil

Inf. Process. Lett., 2002

1999

Minimum spanning trees on polyhedra.

[BibT_eX]

[DOI]