6.849
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Fall 2012
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.
Sources
- Course catalogue ↗Historical OpenCourseWare
- MIT OCW syllabus ↗
- Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.