Star Unfolding Convex Polyhedra via Quasigeodesic Loops
@article{Itoh2010StarUC, title={Star Unfolding Convex Polyhedra via Quasigeodesic Loops}, author={J. Itoh and J. O'Rourke and C. V{\^i}lcu}, journal={Discrete & Computational Geometry}, year={2010}, volume={44}, pages={35-54} }
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 ℘ to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of ℘ to Q, and cut all but one segment of Q.
Figures and Topics from this paper
15 Citations
Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings
- Mathematics, Computer Science
- ArXiv
- 2008
- 2
- PDF
Source Unfoldings of Convex Polyhedra via Certain Closed Curves
- Mathematics, Computer Science
- ArXiv
- 2012
- 1
- PDF
A Generalization of the Source Unfolding of Convex Polyhedra
- Mathematics, Computer Science
- EGC
- 2011
- 4
- PDF
Unfolding cubes: nets, packings, partitions, chords
- Mathematics, Computer Science
- Electron. J. Comb.
- 2020
- PDF
References
SHOWING 1-10 OF 44 REFERENCES
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2008
- 26
- PDF