Geometric Folding Algorithms: Linkages, Origami, Polyhedra
This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional…
Course Description
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. — Course material by Prof. Erik Demaine, MIT OpenCourseWare, used under CC BY-NC-SA 4.0. Original: https://ocw.mit.edu/courses/6-849-geometric-folding-algorithms-linkages-origami-polyhedra-fall-2012/
Related Courses
More from the Algorithms and Data Structures catalogue
