3 search results - page 1 / 1 » Unfolding Convex Polyhedra via Quasigeodesics |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds th...
DCG
2010
13 years 5 months ago
2010
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...
CCCG
2007
13 years 6 months ago
2007
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, always unfold without overlap. The class includes the “domes,” providing a sim...