Class and Lecture Videos

Lecture 7: Origami is Hard

Description: 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.

Speaker: Erik Demaine

Course Info

As Taught In
Fall 2012
Learning Resource Types
Lecture Videos
Problem Sets with Solutions
Instructor Insights