6.849: Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Fall 2020)

Prof. Erik Demaine; Martin Demaine; TAs Yevhenii Diomidov & Klara Mundilova


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

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

[+] Hinged dissections: Locked and unlocked chains of planar shapes, adorned chains, slender adornments, slender implies not locked, Kirszbaun's Theorem, locked triangles with apex angle > 90°; existence of hinged dissections, refinement.
This lecture is about chains of polygons, or other 2D shapes, connected together by hinges in 2D. These structures are classically called “hinged dissections”. On the foldability side, we'll see some surprisingly general situations, called “slender adornments”, where these chains cannot lock, building on the Carpenter's Rule Theorem and expansiveness (Lecture 11). We'll also see some examples that do lock, building on our theory of infinitesimally locked linkages and Rules 1 and 2 (Lecture 12). On the design side, we'll show that we can actually design hinged dissections that fold into any finite collection of desired polygonal shapes, using slender adornments to guarantee foldable motions.

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/14[previous page][next page][PDF]

Figure 1 of http://​erikdemaine.org/​papers/​LockedShapes_DCG/​ (covered under the MIT Faculty Open-Access Policy)

Slides, page 1/14[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.