MIT
Lecture 7: Origami is Hard
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathArt, Design & ArchitectureVisual Arts
Om kurset
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