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 02 - Simple Folds|
This lecture begins with definitions of origami terminology and a demonstration of mountain-valley folding. Turn, hide, and color reversal gadgets, and proofs for folding any shape, Hamiltonian refinement, and foldability with 1D flat folding are presented.
|Class 02 - Universality & Simple Folds|
This lecture begins with a folding exercise of numerical digits. Questions discussed cover strip folding in the context of efficiency, defining pseudopolynomial, seam placement, and clarifications about simple folds and flat-foldability.
Go to the Course Home or watch other lectures: