## 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 13 - Locked Linkages |

This lecture explores algorithms for unfolding 2D chains including ODE, pointed pseudotriangulations, and the energy method. Locking rules are then extrapolated to address Spherical Carpenter's Rule, infinitesimally locked linkages, and locked 3D chains.

Class 13 - Locked Linkages |

This class reviews Carpenter's Rule and properties of pseudotriangulation. Various proofs are presented, which cover topics including non-zero stresses, linear and equilateral locked trees, and unfolding of 4D chains.

Go to **the Course Home** or watch other lectures: