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 1 Video     [next]

Overview of the entire class: Topics and problems considered.
OPTIONAL — L01 can be skipped, though it gives a more detailed overview of the class than C01.

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

http://​www.gutenberg.org/​files/​25155/​25155-pdf.pdf “This eBook is for the use of anyone anywhere at no cost and with almost no restrictions whatsoever”

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