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 05 - Artistic Origami Design |
This lecture presents both the traditional and non-traditional style of origami with many visual examples. The lecture then moves onto applying tree method to design origami, and includes a design example for a crab using TreeMaker.
| Class 05 - Tessellations & Modulars |
This lecture introduces more examples of origami models that use a variety of techniques and media. At the end of the session, the class participates in a folding exercise that uses business cards to make modular cubes.
Go to the Course Home or watch other lectures: