Ununfoldable polyhedra with convex faces

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex faces and one with 36 triangular faces, that cannot be unfolded by cutting along 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 triangular faces may not be unfoldable no matter how they are cut.

[1]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[2]  Satyandra K. Gupta,et al.  Automated process planning for sheet metal bending operations , 1998 .

[3]  David Eppstein,et al.  Vertex-Unfoldings of Simplicial Polyhedra , 2001, ArXiv.

[4]  G. Ziegler,et al.  Basic properties of convex polytopes , 1997 .

[5]  Micha Sharir,et al.  On shortest paths in polyhedral spaces , 1986, STOC '84.

[6]  E. Demaine,et al.  Folding and unfolding , 2002 .

[7]  Erik D. Demaine,et al.  Enumerating Foldings and Unfoldings Between Polygons and Polytopes , 2002, Graphs Comb..

[8]  Erik D. Demaine,et al.  Folding and Unfolding Linkages, Paper, and Polyhedra , 2000, JCDCG.

[9]  Catherine A. Schevon.  Algorithms for geodesics on convex polytopes , 1990 .

[10]  Erik D. Demaine,et al.  Unfolding some classes of orthogonal polyhedra , 1998, CCCG.

[11]  Joseph O'Rourke,et al.  Folding and Unfolding in Computational Geometry , 1998, JCDCG.

[12]  G. C. Shephard.  Convex polytopes with convex nets , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.

[13]  Cheng-Hua Wang.  Manufacturability-Driven Decomposition of Sheet Metal Products , 1997 .

[14]  E. Steinitz,et al.  Vorlesungen über die Theorie der Polyeder unter Einfluss der Elemente der Topologie , 1934 .

[15]  Boris Aronov,et al.  Star Unfolding of a Polytope with Applications , 1997, SIAM J. Comput..

[16]  Erik D. Demaine,et al.  Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes , 2000, ArXiv.

[17]  Kenneth Falconer,et al.  Unsolved Problems In Geometry , 1991 .

[18]  Boris Aronov,et al.  Nonoverlap of the star unfolding , 1991, SCG '91.

[19]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[20]  H. S. M. Coxeter,et al.  Vorlesungen über die Theorie der Polyeder , 1935 .

[21]  David Eppstein,et al.  Ununfoldable polyhedra , 1999, CCCG.