Part III Polyhedra a Folding Polygons Joseph ORourke

  • Slides: 20
Download presentation
Part III: Polyhedra a: Folding Polygons Joseph O’Rourke Smith College

Part III: Polyhedra a: Folding Polygons Joseph O’Rourke Smith College

Outline: Folding Polygons z Alexandrov’s Theorem z Algorithms y Edge-to-Edge Foldings z Examples y

Outline: Folding Polygons z Alexandrov’s Theorem z Algorithms y Edge-to-Edge Foldings z Examples y Foldings of the Latin Cross y Foldings of the Square z Open Problems y Transforming shapes?

Aleksandrov’s Theorem (1941) z “For every convex polyhedral metric, there exists a unique polyhedron

Aleksandrov’s Theorem (1941) z “For every convex polyhedral metric, there exists a unique polyhedron (up to a translation or a translation with a symmetry) realizing this metric. "

Alexandrov Gluing (of polygons) z Uses up the perimeter of all the polygons with

Alexandrov Gluing (of polygons) z Uses up the perimeter of all the polygons with boundary matches: x No gaps. x No paper overlap. x Several points may glue together. z At most 2 angle at any glued point. z Homeomorphic to a sphere. Aleksandrov’s Theorem unique “polyhedron”

Folding the Latin Cross

Folding the Latin Cross

Folding Polygons to Convex Polyhedra z When can a polygon fold to a polyhedron?

Folding Polygons to Convex Polyhedra z When can a polygon fold to a polyhedron? y “Fold” = close up perimeter, no overlap, no gap : z When does a polygon have an Aleksandrov gluing?

Unfoldable Polygon

Unfoldable Polygon

Foldability is “rare” Lemma: The probability that a random polygon of n vertices can

Foldability is “rare” Lemma: The probability that a random polygon of n vertices can fold to a polytope approaches 0 as n 1.

Perimeter Halving

Perimeter Halving

Edge-to-Edge Gluings z Restricts gluing of whole edges to whole edges. [Lubiw & O’Rourke,

Edge-to-Edge Gluings z Restricts gluing of whole edges to whole edges. [Lubiw & O’Rourke, 1996]

New Re-foldings of the Cube

New Re-foldings of the Cube

Video [Demaine , Lubiw , JOR, Pashchenko (Symp. Computational Geometry, 1999)]

Video [Demaine , Lubiw , JOR, Pashchenko (Symp. Computational Geometry, 1999)]

Open: Practical Algorithm for Cauchy Rigidty Find either § a polynomial-time algorithm, § or

Open: Practical Algorithm for Cauchy Rigidty Find either § a polynomial-time algorithm, § or even a numerical approximation procedure, that takes as § input the combinatorial structure and edge lengths of a triangulated convex polyhedron, and § outputs coordinates for its vertices.

Two Case Studies z The Latin Cross z The Square

Two Case Studies z The Latin Cross z The Square

Folding the Latin Cross z 85 distinct gluings z Reconstruct shapes by ad hoc

Folding the Latin Cross z 85 distinct gluings z Reconstruct shapes by ad hoc techniques z 23 incongruent convex polyhedra

23 Latin Cross Polyhedra Sasha Berkoff, Caitlin Brady, Erik Demaine, Martin Demaine, Koichi Hirata,

23 Latin Cross Polyhedra Sasha Berkoff, Caitlin Brady, Erik Demaine, Martin Demaine, Koichi Hirata, Anna Lubiw, Sonya Nikolova, Joseph O’Rourke

Foldings of a Square z Infinite continuum of polyhedra. z Connected space

Foldings of a Square z Infinite continuum of polyhedra. z Connected space

Dynamic Web page

Dynamic Web page

Open: Fold/Refold Dissections [M. Demaine 98] Can a cube be cut open and unfolded

Open: Fold/Refold Dissections [M. Demaine 98] Can a cube be cut open and unfolded to a polygon that may be refolded to a regular tetrahedron (or any other Platonic solid)?

Koichi Hirata

Koichi Hirata