2000 character limit reached
Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings
Published 12 Dec 2008 in cs.CG | (0812.2257v1)
Abstract: We extend the notion of a star unfolding to be based on a simple 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, planar polygon: shortest paths from all vertices of P to Q are cut, and all but one segment of Q is cut.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.