Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings
Computational Geometry
2008-12-15 v1
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.
Cite
@article{arxiv.0812.2257,
title = {Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings},
author = {Jin-ichi Itoh and Joseph O'Rourke and Costin Vîlcu},
journal= {arXiv preprint arXiv:0812.2257},
year = {2008}
}
Comments
18 pages, 10 figures