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