MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012
View the complete course: [ Ссылка ]
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
More information at [ Ссылка ]
More courses at [ Ссылка ]
![](https://s2.save4k.ru/pic/voMyQUarX-k/maxresdefault.jpg)