Vertex-Unfoldings of Simplicial Manifolds
<|reference_start|>Vertex-Unfoldings of Simplicial Manifolds: We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifold is cut only along its edges. The resulting layout is connected, but it may have a disconnected interior; the triangles are connected at vertices, but not necessarily joined along edges. We extend our algorithm to establish a similar result for simplicial manifolds of arbitrary dimension.<|reference_end|>
@article{demaine2001vertex-unfoldings,
    title={Vertex-Unfoldings of Simplicial Manifolds},
    author={Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph
  O'Rourke},
    journal={arXiv preprint arXiv:cs/0110054},
    year={2001},
    number={Smith Technical Report 072},
    archivePrefix={arXiv},
    eprint={cs/0110054},
    primaryClass={cs.CG cs.DM}
}