MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Lecture 2: Simple Folds

4.0 (0)

5 learners

What you'll learn

This course includes

42.5 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

6-849-geometric-folding-algorithms-linkages-origami-polyhedra-fall-2012 crease pattern crimp dual graph end fold flat folding foldability folded state gadget hamiltonion refinement mountain origami

Full Transcript

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 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 http://ocw.mit.edu/terms More courses at http://ocw.mit.edu