Video details loaded
HomeMIT 6.849 Geometric Folding Algorithms, Fall 2012Class 7: Origami is Hard
Class 7: Origami is Hard
49:35
Description: This lecture begins with several examples of box-pleating and maze-folding. Clarifications on NP-hardness are provided with a walkthrough of a proof. Additional folding gadgets are introduced and non-simple folds are addresed.
Speaker: Erik Demaine