Class 3: Single-Vertex Crease Patterns

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012
Instructor: Erik Demaine

This class reviews algorithms for testing flat-foldability for a 1D MV pattern and for single-vertex MV pattern. An exercise walks through determining local flat-foldability, and questions cover higher dimensions and motivations for flat-foldability.

License: Creative Commons BY-NC-SA

[colleenforrest]

for the question at 10:23, the questioner is asuming "back a step" means going back to segment x, which grows from x to x + (z - y), when the crimp folds segment y, but here we actually go back to the segment just before x, which does not grow after the crimp.