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

Prof. Erik Demaine TA: Jayson Lynch

[Home] [Problem Sets] [Project] [Lectures] [Problem Session Notes] [Accessibility]

Class 3 Video [previous] [next]

[+] Single-vertex crease patterns: Linear-time algorithm, local foldability examples, T-shirt folding, higher dimensions, why flat foldability?
This class addresses these questions/comments about Lecture 3 (and Lecture 2): How can we quickly determine whether a single-vertex mountain-valley pattern is flat foldable? We'll also cover the algorithm for 1D flat folding that we didn't have time to cover in Class 2. Examples of how the local foldability algorithm works. T-shirt folding (for fun) Higher-dimensional flat folding (what little is known) Why do we study flat foldability? Art (e.g. tessellations), practicality (compactness e.g. airbags), and mathematics (e.g. rigid foldability).

Download Video: 360p, 720p

Handwritten notes, page 1/4 • [previous page] • [next page] • [PDF]

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