2001/07/18 by Erik D. Demaine, Martin L. Demaine, Anna Lubiw +1 · 1 citation
Computer Science · #cs.CG #cs.DM
published as Graphs and Combinatorics 18(1) 93-104 (2002) · 12 pages; 10 figures; 10 references. Revision of version in Proceedings of the Japan Conference on Discrete and Computational Geometry, Tokyo, Nov. 2000, pp. 9-12. See also cs.CG/0007019
arxiv created 2001/07/18 · arxiv updated 2009/11/30
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.