Star Unfolding Convex Polyhedra via Quasigeodesic Loops

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 P to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of P to Q, and cut all but one segment of Q. Keywords Unfolding

• Type: Journal
• Year: 2010
• Where: DCG
• Authors: Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu
• Keywords: Convex Polyhedron, DCG 2010, Shortest Paths, Unfolding