Name: Lecture 7: Origami is Hard
Uploaded: 2014-08-26T13:24:00Z
Duration: 1 h 22 min 3 s
Description: 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

1:22:03

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