Lecture 2: Simple Folds

MIT Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: Instructor: Erik Demaine This lecture begins with definitions of origami terminology and a demonstration of mountain-valley folding. Turn, hide, color reversal gadgets, proofs for folding any shape, Hamiltonian refinement, and foldability with 1D flat folding are presented. License: Creative Commons BY-NC-SA More information at More courses at http
Back to Top