Academic
Publications
Star Unfolding Convex Polyhedra via Quasigeodesic Loops

Star Unfolding Convex Polyhedra via Quasigeodesic Loops,10.1007/s00454-009-9223-x,Discrete & Computational Geometry,Jin-ichi Itoh,Joseph O’Rourke,Cost

Star Unfolding Convex Polyhedra via Quasigeodesic Loops   (Citations: 3)
BibTex | RIS | RefWorks Download
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.
Journal: Discrete & Computational Geometry - DCG , vol. 44, no. 1, pp. 35-54, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Four general unfolding algorithms are known for arbitrary convex polyhedra: the source unfolding [15,11],thestarunfolding[4],andtwovariationsthereof[10,9].Positiveandnegative results for unfolding nonconvex polyhedra can be found in [5,7,13]...

    Erik D. Demaineet al. Continuous Blooming of Convex Polyhedra

Sort by: