Document Type
Article
Publication Date
2002
Publication Title
Proceedings of the Eighteenth Annual Symposium on Computational Geometry
Abstract
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.
First Page
237
Last Page
243
DOI
dx.doi.org/10.1145/513400.513429
Recommended Citation
Demaine, Erik D.; Eppstein, David; Erickson, Jeff; Hart, George W.; and O'Rourke, Joseph, "Vertex-Unfoldings of Simplicial Manifolds" (2002). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/60
Comments
Author’s submitted manuscript. ISBN: 1-58113-504-1. Subsequently published as a chapter in an edited volume:
Demaine, E. D., Eppstein, D., Erickson, J., Hart, G. W., & O'Rourke, J. (2003). Vertex-unfoldings of simplicial manifolds. In Kuperberg, W. & Bezdek, A. (Eds.), Discrete geometry: In honor of W. Kuperberg's 60th birthday (pp. 232-245). New York: Marcel Dekker.