Enumerating Foldings and Unfoldings between Polygons and Polytopes
<|reference_start|>Enumerating Foldings and Unfoldings between Polygons and Polytopes: 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.<|reference_end|>
@article{demaine2001enumerating,
    title={Enumerating Foldings and Unfoldings between Polygons and Polytopes},
    author={Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke},
    journal={Graphs and Combinatorics 18(1) 93-104 (2002)},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0107024},
    primaryClass={cs.CG cs.DM}
}