Vertex-Unfoldings of Simplicial Polyhedra
<|reference_start|>Vertex-Unfoldings of Simplicial Polyhedra: We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have a disconnected interior: the triangles are connected at vertices, but not necessarily joined along edges.<|reference_end|>
@article{demaine2001vertex-unfoldings,
    title={Vertex-Unfoldings of Simplicial Polyhedra},
    author={Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph
  O'Rourke},
    journal={Discrete Geometry: In honor of W. Kuperberg's 60th birthday, Pure
  and Appl. Math. 253, Marcel Dekker, pp. 215-228, 2003},
    year={2001},
    number={Smith Tech. Rep. 071},
    archivePrefix={arXiv},
    eprint={cs/0107023},
    primaryClass={cs.CG cs.DM}
}