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)
|Lecture 06 - Architectural Origami|
This lecture presents Origamizer, freeform origami, and rigid origami applied to architectural and three-dimensional design contexts. Geometric constraints, demonstration videos, and physical models are shown for each portion of the lecture.
|Class 06 - Architectural Origami|
This lecture begins with a folding exercise and demonstration involving Origamizer. A high-level overview of the mathematical constraints for Freeform and Rigid software are presented, followed by examples of origami robots and current open problems.
Go to the Course Home or watch other lectures: