Enumerating Foldings and Unfoldings Between Polygons and Polytopes

Authors

Erik D. Demaine, University of Waterloo
Martin L. Demaine, University of Waterloo
Anna Lubiw, University of Waterloo
Joseph O'Rourke, Smith CollegeFollow

Document Type

Article

Publication Date

3-2002

Publication Title

Graphs and Combinatorics

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.

Volume

18

Issue

1

First Page

93

Last Page

104

DOI

dx.doi.org/10.1007/s003730200005

ISSN

1435-5914

Comments

Peer reviewed accepted manuscript. Language included at publisher's request: The final publication is available at Springer via http://dx.doi.org/10.1007/s003730200005.

Recommended Citation

Demaine, Erik D.; Demaine, Martin L.; Lubiw, Anna; and O'Rourke, Joseph, "Enumerating Foldings and Unfoldings Between Polygons and Polytopes" (2002). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/63