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 a"similar to to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of a"similar to to Q, and cut all but one segment of Q.
star unfolding unfolding convex polyhedra quasigeodesics quasigeodesic loops shortest paths