MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Ununfoldable Polyhedra (1999) [15 citations — 7 self]

by Marshall Bern ,  Erik D. Demaine ,  David Eppstein ,  Eric Kuo
Add To MetaCart

Abstract:

A well-studied problem is that of unfolding a convex polyhedron into a simple planar polygon. In this paper, we study the limits of unfoldability. We give an example of a polyhedron with convex faces that cannot be unfolded by cutting along its edges. We further show that such a polyhedron can indeed be unfolded if cuts are allowed to cross faces. Finally, we prove that "open" polyhedra with convex faces may not be unfoldable no matter how they are cut.

Citations

108 The discrete geodesic problem – Mitchell, Mount, et al. - 1987
74 On shortest paths in polyhedral spaces – Sharir, Schorr - 1986
55 Vorlesungen über die Theorie der Polyeder – Steinitz, Rademacher - 1934
51 Folding and unfolding in computational geometry – O'Rourke - 1998
36 Convex Polytopes. Interscience – Grunbaum - 1967
33 Unfolding some classes of orthogonal polyhedra – Biedl, Demaine, et al. - 1998
30 Schevon, Star unfolding of a polytope with applications – Agarwal, Aronov, et al. - 1997
26 Nonoverlap of the star unfolding – Aronov, O'Rourke - 1992
26 Convex polytopes with convex nets – Shephard - 1975
26 Polyhedron Models – Wenninger - 1971
22 Automated process planning for sheet metal bending operations – Gupta, Bourne, et al. - 1998
16 Manufacturability-driven decomposition of sheet metal – Wang - 1997
12 Basic properties of convex polytopes – Henk, Richter-Gebert, et al. - 1997
12 Unfolding 3-dimensional convex polytopes: A package for mathematica 1.2 or 2.0, version 1.0 – Namiki, Fukuda - 1994
6 Unfolding polyhedra. sci.math Usenet article – Schevon - 1987
5 Strange unfoldings of convex polytopes – Fukuda - 1997
5 Pleasures of plication – Hayes - 1995
1 Pleasures of plication. American Scientist, November--December – Hayes - 1995