6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra
6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Fall 2012, MIT OCW). Instructor: Professor Erik Demaine. This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. Applications to architecture, robotics, manufacturing, and biology are also covered in this course. (from ocw.mit.edu)
| Lecture 03 - Single-Vertex Crease Patterns |
This lecture explores the local behavior of a crease pattern and characterizing flat-foldability of single-vertex crease patterns. Kawasaki's theorem and Maekawa's theorem are presented as well as the tree method with Robert Lang's TreeMaker.
| Class 03 - Single-Vertex Crease Patterns |
This lecture reviews algorithms for testing flat-foldability for a 1D MV pattern and for single-vertex MV pattern. An exercise walks through determining local flat-foldability, and questions cover higher dimensions and motivations for flat-foldability.
Go to the Course Home or watch other lectures: