Preprint, July 2001.

arXiv:cs.CG/0107023

- Download:
- See the updated version: "Vertex-unfoldings of simplicial polyhedra".

Abstract:

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.

Publications - Jeff Erickson (jeffe@cs.uiuc.edu) 27 Oct 2001