MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012
View the complete course: [ Ссылка ]
Instructor: Erik Demaine
This class covers how the pebble algorithm works with first a proof of the 2k property, and then 2k-3. Generic rigidity and the running time of the algorithm is discussed, and software simulations running the algorithm are shown.
License: Creative Commons BY-NC-SA
More information at [ Ссылка ]
More courses at [ Ссылка ]
![](https://i.ytimg.com/vi/yvatNaV6Bog/maxresdefault.jpg)