## 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 18 - Gluing Algorithms |

This lecture begins how to construct a gluing tree. Combinatorial bounds and algorithms are proved for gluing results, which include the general case, edge-to-edge, and bounded sharpness. The different gluings for the cross are also shown.

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