论文信息 - Enumerating Foldings and Unfoldings Between Polygons and Polytopes

Enumerating Foldings and Unfoldings Between Polygons and Polytopes

Abstract. We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are, roughly: exponentially many, or nondenumerably infinite.

Erik D. Demaine | Joseph O'Rourke | Anna Lubiw | Martin L. Demaine

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

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

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

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

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

[6] J. O'Rourke,et al. When Can a Polygon Fold to a Polytope , 1999 .

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

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