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 01 - Overview |
This lecture introduces the topics covered in the course and its motivation. Examples of applications are provided, along with types and characterizations of geometric objects, foldability and design questions, and results. Select open problems are also introduced.
| Class 01 - Overview |
This lecture introduces the inverted structure of the class, the topics covered in the course and its motivation. Examples of applications are provided, along with types and characterizations of geometric objects, and foldability and design questions.
Go to the Course Home or watch other lectures: