Enumerating Foldings and Unfoldings Between Polygons and Polytopes

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.

• Publication year

  2001

• Venue

  Graphs Comb.

• Publication date

  2001-07-18

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/S003730200005arXiv cs/0107024
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

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

  2000cited by this paper
• When Can a Polygon Fold to a Polytope

  1999cited by this paper
• Ununfoldable polyhedra

  1999cited by this paper
• Unfolding some classes of orthogonal polyhedra

  1998cited by this paper
• Folding and Unfolding in Computational Geometry

  1998cited by this paper
• Star Unfolding of a Polytope with Applications

  1997cited by this paper
• Nonoverlap of the star unfolding

  1991cited by this paper
• Convex polytopes with convex nets

  1975cited by this paper

• All Polyhedral Manifolds are Connected by a 2-Step Refolding

  2024cites this paper
• Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time

  2021cites this paper
• A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons

  2020cites this paper
• Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons?

  2019cites this paper
• Common Edge-Unzippings for Tetrahedra

  2016cites this paper
• Folding concave polygons into convex polyhedra: The L-Shape

  2015cites this paper
• Unfolding a Problem.

  2015cites this paper
• PCB Origami Folding circuit boards into electronic products

  2013cites this paper
• PCB origami : folding circuit boards into electronic products

  2013cites this paper
• PCB ORIGAMI: A MATERIAL-BASED DESIGN APPROACH TO COMPUTER-AIDED FOLDABLE ELECTRONIC DEVICES

  2013cites this paper
• Origami-von der Kunst und der Wissenschaft des Papierfaltens

  2013cites this paper
• Common Edge-Unzippings for Tetrahedra

  2011cites this paper
• Flat Zipper-Unfolding Pairs for Platonic Solids

  2010influential citation
• On the Number of Spanning Trees a Planar Graph Can Have

  2009cites this paper
• A Pseudopolynomial Algorithm for Alexandrov's Theorem

  2008cites this paper
• A Pseudopolynomial Algorithm for Alexandrov ’ s Theorem

  2008cites this paper
• A PSEUDOPOLYNOMIAL ALGORITHM

  2008cites this paper
• Chromatic Numbers of Specified Isohedral Tilings

  2008cites this paper
• A Survey of Folding and Unfolding in Computational Geometry

  2007influential citation
• Optimal design of flat patterns for 3D folded structures by unfolding with topological validation

  2007cites this paper
• Geometric Folding Algorithms: Linkages

  2007cites this paper
• Reconfigurations of polygonal structures

  2005cites this paper
• A motion planning approach to protein folding

  2003cites this paper
• On Convex Developments of a Doubly-Covered Square

  2003cites this paper
• Flat 2-Foldings of Convex Polygons

  2003cites this paper
• Folding and unfolding

  2002cites this paper
• Recent Results in Computational Origami

  2002cites this paper
• The Foldings of a Square to Convex Polyhedra

  2002cites this paper
• Folding and Unfolding Linkages, Paper, and Polyhedra

  2000cites this paper
• Ununfoldable polyhedra with convex faces

  1999cites this paper
• MIT Open Access Articles A pseudopolynomial algorithm for Alexandrov's theorem

  year unknowncites this paper