# Enumerating Foldings and Unfoldings Between Polygons and Polytopes

@article{Demaine2002EnumeratingFA, title={Enumerating Foldings and Unfoldings Between Polygons and Polytopes}, author={E. Demaine and Martin L. Demaine and A. Lubiw and J. O'Rourke}, journal={Graphs and Combinatorics}, year={2002}, volume={18}, pages={93-104} }

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.

26 Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-9 OF 9 REFERENCES

Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes

- Mathematics, Computer Science
- 2000

10

Department of Mathematics, Faculty of Education, Ehime University, Japan

- 2000