InfoCoBuild

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)

This lecture covers infinitesimal rigidity and motion, and tensegrity systems as an extension of rigidity theory. The rigidity matrix, equilibrium stress, and duality are introduced, and a proof to Carpenter's Rule Theorem is presented.

This class covers several examples of tensegrity structures and in Freeform software. A question on linear programming's application to the motions and stresses is addressed.

Go to the Course Home or watch other lectures: