Lecture 3: Single-Vertex Crease Patterns

MIT Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: Instructor: Erik Demaine This lecture explores the local behavior of a crease pattern and characterizing flat-foldability of single-vertex crease patterns. Kawasaki’s theorem and Maekawa’s theorem are presented as well as the tree method with Robert Lang’s TreeMaker. License: Creative Commons BY-NC-SA More information at More courses at http://ocw.m