Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Free, no sign-up neededFall 2012English
About this course
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. Acknowledgments Thanks to videographers Martin Demaine and Jayson Lynch.
Description from MIT OpenCourseWare.
Where to take this course
- Open MIT OpenCourseWare (new tab)MIT OpenCourseWare · Fall 2012