2000 character limit reached
Star Unfolding Convex Polyhedra via Quasigeodesic Loops (0707.4258v4)
Published 28 Jul 2007 in cs.CG and cs.DM
Abstract: 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 (non-overlapping), planar polygon: cut along one shortest path from each vertex of P to Q, and cut all but one segment of Q.