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]

Lecture 3 Video     [previous] [next]

[+] Single-vertex crease patterns: Characterizations of flat-foldable crease patterns and mountain-valley patterns, combinatorics of the latter, local flat foldability is easy.
Tree method of origami design: Introduction, uniaxial base, demo.

This lecture is about the local behavior of flat folding around each vertex of a crease pattern. In other words, we study each vertex individually, by characterizing all single-vertex crease patterns and mountain-valley patterns that are flat foldable. Then we look at how to combine multiple vertices into a "locally foldable" crease pattern.

We also get started on the tree method of origami design, developed by many Japanese origami designers over the years, and turned into an algorithm and computer program TreeMaker by Robert Lang. This method has been the most successful in transforming complex origami design, and we'll cover more of it next lecture.

Download Video: 360p, 720p

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

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

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

Figure 16.2 from GFALOP

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