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)
Overview |
References |
6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Fall 2012) Instructor: Professor Erik Demaine. Calendar and Notes. Projects (no examples). Assignments and Solutions. This course focuses on the algorithms for analyzing and designing geometric foldings. |
6.849: Geometric Folding Algorithms: Linkages, Origami, Polyhedra Instructor: Professor Erik Demaine. Problem Sets. Project. Lectures: Notes; Slides; Video. Whenever you have a physical object to be reconfigured, geometric folding often comes into play. |