filmov
tv
Class 7: Origami is Hard
Показать описание
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012
Instructor: Erik Demaine
This class 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.
License: Creative Commons BY-NC-SA
Instructor: Erik Demaine
This class 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.
License: Creative Commons BY-NC-SA
0:49:35
1:22:03
0:00:06
0:00:18
0:00:19
0:00:14
0:00:37
0:00:12
0:01:00
0:00:33
0:01:21
0:00:56
0:00:25
0:00:22
0:00:51
0:00:23
0:00:14
0:00:35
0:00:27
0:00:57
0:01:00
0:01:01
0:00:16
0:00:15