Document Type


Publication Date


Publication Title

Proceedings of the Eighteenth Annual Symposium on Computational Geometry


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


Last Page




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.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.