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 post-print. Language included at publisher's request: The final publication is available at Springer via http://dx.doi.org/10.1007/s003730200005.

Share

COinS