Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
The structure of the set of all convex polyhedra foldable from a square is detailed. It is proved that five combinatorially distinct nondegenerate polyhedra, and four different flat polyhedra, are realizable. All the polyhedra are continuously deformable into each other, with the space of polyhedra having the topology of four connected rings.
© the authors
Alexander, Rebecca; Dyson, Heather; and O'Rourke, Joseph, "The Foldings of a Square to Convex Polyhedra" (2003). Computer Science: Faculty Publications, Smith College, Northampton, MA.