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 14 - Hinged Dissections |
This lecture introduces adorned chains and slender chains. Proofs involving these definitions, as well as locked polygons and hinged dissections, are presented.
| Class 14 - Hinged Dissections |
This class focuses on hinged dissections. Examples of hinged dissections and several built, reconfigurable applications are offered Pseudopolynomials, triangulation, and 3D dissections are then discussed.
Go to the Course Home or watch other lectures: