Lecture 7: Origami is Hard

Published: June 24, 2015, 7:24 p.m.

This lecture introduces universal hinge patterns with the cube and maze gadget. NP-hardness problems involving partition and satisfiability are presented with examples of simple folds, global flat foldability, and disk packing.