Skip to main content
Log in

Enumerating Foldings and Unfoldings Between Polygons and Polytopes

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: November 13, 2000 Final version received: August 21, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Demaine, E., Demaine, M., Lubiw, A. et al. Enumerating Foldings and Unfoldings Between Polygons and Polytopes. Graphs Comb 18, 93–104 (2002). https://doi.org/10.1007/s003730200005

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730200005

Keywords

Navigation