6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra


Class Info

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 be offered this semester (Spring 2019). It is instructed by E. D. Demaine.

This class counts for a total of 12 credits.

You can find more information at the MIT + 6.849 - Google Search site or on the 6.849 Stellar site.

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra Related Textbooks
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra On The Web
MIT + 6.849 - Google Search

© Copyright 2015