6.849: Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Spring 2017)

Prof. Erik Demaine; Martin Demaine; Dr. Jason Ku; TAs Adam Hesterberg & Jayson Lynch

[Home] [Problem Sets] [Project] [Lectures] [Coauthor] [Accessibility]

Lecture 15 Video     [previous] [next] [completion form]

[+] Polyhedron unfolding: Vertex unfolding, facet paths, generally unfolding orthogonal polyhedra, grid unfolding, refinement, Manhattan towers, orthostacks, orthotubes, orthotrees.
Polyhedron folding: Cauchy's Rigidity Theorem, Alexandrov's uniqueness of folding.
This lecture continues the theme of unfolding polyhedra, and kicks off our coverage of folding polygons into polyhedra.

On the unfolding side, we'll cover “vertex unfolding”, which is a variation on edge unfolding kind of like hinged dissections. We'll prove that this type of unfolding exists, even for nonconvex polyhedra, provided every face is a triangle. Then we'll cover recent breakthroughs in general unfolding, for orthogonal polyhedra.

On the folding side, we'll prove Cauchy's Rigidity Theorem: convex polyhedra have exactly one convex realization (viewing faces as rigid and edges as hinges). Then we'll show how to extend this to Alexandrov's Uniqueness Theorem: if you glue up the boundary of a polygon, there's at most one convex polyhedron you can make. (Next lecture we'll see how to actually get one.)

YQ Lu will give a guest lecture about his work in paper sliceforms, as embodied by his software Sliceform Studio [https://www.sliceformstudio.com/]. See his resulting artwork at https://www.sliceformstudio.com/gallery.html.

Then we'll work on problems related to gluings and sphere wrapping.

Download Video: 360p, 720p

Handwritten notes, page 1/8[previous page][next page][PDF]

Handwritten notes, page 1/8[previous page][next page][PDF]

Slides, page 1/26[previous page][next page][PDF]

Edge unfolding vs. general unfolding (figures drawn by Erik Demaine)

Slides, page 1/26[previous page][next page][PDF]

The video above should play if your web browser supports either modern Flash or HTML5 video with H.264 or WebM codec. The handwritten notes and slides should advance automatically. If you have any trouble with playback, email Erik.