Enumerating foldings and unfoldings between polygons and polytopes (Q1348668)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1740506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating foldings and unfoldings between polygons and polytopes |
scientific article; zbMATH DE number 1740506 |
Statements
Enumerating foldings and unfoldings between polygons and polytopes (English)
0 references
14 May 2002
0 references
The authors explore the process of folding a simple polygon by gluing its perimeter shut to form a convex polyhedron, and its reverse, cutting a convex polyhedron open and flattening its surface to a simple polygon. They 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. Their answers are, roughly: exponentially many, or nondenumerably infinite.
0 references
foldings
0 references
polytope
0 references
polygon unfoldings
0 references
enumeration
0 references
0.8228679299354553
0 references
0.8218997120857239
0 references
0.8187857866287231
0 references
0.8187857866287231
0 references