Enumerating Foldings and Unfoldings between Polygons and Polytopes

Simple item page
dc.creatorDemaine, Erik D.
dc.creatorDemaine, Martin L.
dc.creatorLubiw, Anna
dc.creatorO'Rourke, Joseph
dc.date2001-07-18
dc.date.accessioned2026-07-07T03:17:21Z
dc.date.available2026-07-07T03:17:21Z
dc.descriptionWe 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.
dc.description12 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
dc.identifierhttps://arxiv.org/abs/cs/0107024
dc.identifierhttp://arxiv.org/abs/cs/0107024
dc.identifierGraphs and Combinatorics 18(1) 93-104 (2002)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30695
dc.subjectComputational Geometry
dc.subjectDiscrete Mathematics
dc.subjectF.2.2; G.2.1
dc.titleEnumerating Foldings and Unfoldings between Polygons and Polytopes
dc.typetext

Files

Collections

arXiv