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
Instructor
Departments
As Taught In
Fall
2012
Level
Topics
Learning Resource Types
theaters
Lecture Videos
assignment_turned_in
Problem Sets with Solutions
group_work
Projects
Instructor Insights
