6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Covers discrete geometry and algorithms underlying the reconfiguration of foldable structures, with applications to robotics, manufacturing, and biology. Linkages made from one-dimensional rods connected by hinges: constructing polynomial curves, characterizing rigidity, characterizing unfoldable versus locked, protein folding. Folding two-dimensional paper (origami): characterizing flat foldability, algorithmic origami design, one-cut magic trick. Unfolding and folding three-dimensional polyhedra: edge unfolding, vertex unfolding, gluings, Alexandrov's Theorem, hinged dissections.
This class has 6.046 as a prerequisite.
6.849 will not be offered this semester. It will be available in the Spring semester, and will be instructed by E. D. Demaine.
Lecture occurs 2:30 PM to 5:00 PM on Wednesdays in 54-100.
This class counts for a total of 12 credits.
You can find more information at the MIT + 6.849 - Google Search site.
© Copyright 2015 Yasyf Mohamedali