Video details loaded
HomeMIT 6.849 Geometric Folding Algorithms, Fall 2012Class 11: Generic Rigidity
Class 11: Generic Rigidity
50:23
Description: 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.
Speaker: Erik Demaine