Prof. 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.
Thanks to videographers Martin Demaine and Jayson Lynch.
Demaine, Erik. 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-849-geometric-folding-algorithms-linkages-origami-polyhedra-fall-2012 (Accessed). License: Creative Commons BY-NC-SA