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.
Original language | English (US) |
---|---|
Title of host publication | Discrete Geometry |
Subtitle of host publication | In Honor of W. Kuperberg's 60th Birthday |
Publisher | CRC Press |
Pages | 215-228 |
Number of pages | 14 |
ISBN (Electronic) | 9780203911211 |
ISBN (Print) | 9780824709686 |
DOIs | |
State | Published - Jan 1 2003 |
Externally published | Yes |
ASJC Scopus subject areas
- General Mathematics