Vertex-unfoldings of simplicial polyhedra (2001)
by
Erik D. Demaine
,
Jeff Erickson
| Venue: | in Firms’ Financing Activities, Bank of Japan |
| Citations: | 2 - 2 self |
BibTeX
@TECHREPORT{Demaine01vertex-unfoldingsof,
author = {Erik D. Demaine and Jeff Erickson},
title = {Vertex-unfoldings of simplicial polyhedra},
institution = {in Firms’ Financing Activities, Bank of Japan},
year = {2001}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1
Citations
| 59 | Hamiltonian triangulations for fast rendering - Arkin, Held, et al. - 1996 |
| 51 | Folding and unfolding in computational geometry - O'Rourke - 2000 |
| 39 | Computational Geometry in C (Second Edition - O’Rourke - 1998 |
| 30 | Dissections: Plane and Fancy - Frederickson - 1997 |
| 29 | Unfolding some classes of orthogonal polyhedra - Biedl, Demaine, et al. - 1998 |
| 28 | Planar orientations with low out-degree and compaction of adjacency matrices, Theoretical Computer Science 86 - Chrobak, Eppstein - 1991 |
| 22 | Ununfoldable polyhedra with convex faces - Bern, Demaine, et al. - 2003 |
| 14 | Kuo - Ununfoldable Polyhedra - Bern, Demaine, et al. |
