Enumerating Foldings and Unfoldings between Polygons and Polytopes
Computational Geometry
2007-05-23 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.cs/0107024,
title = {Enumerating Foldings and Unfoldings between Polygons and Polytopes},
author = {Erik D. Demaine and Martin L. Demaine and Anna Lubiw and Joseph O'Rourke},
journal= {arXiv preprint arXiv:cs/0107024},
year = {2007}
}
Comments
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