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) |
|---|---|
| Pages | 237-243 |
| Number of pages | 7 |
| DOIs | |
| State | Published - 2002 |
| Externally published | Yes |
| Event | Proceedings of the 18th Annual Symposium on Computational Geometry (SCG'02) - Barcelona, Spain Duration: Jun 5 2002 → Jun 7 2002 |
Other
| Other | Proceedings of the 18th Annual Symposium on Computational Geometry (SCG'02) |
|---|---|
| Country/Territory | Spain |
| City | Barcelona |
| Period | 6/5/02 → 6/7/02 |
Keywords
- Edge-unfolding
- Facet cycles
- Facet paths
- Facet-vertex incidence graph
- Hinged dissections
- Manifolds with boundary
- Polyhedra
- Ridge-unfolding
- Simplicial manifolds
- Triangulated 2-manifolds
- Unfolding
- Vertex-unfolding
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics