MIT
Class 11: Generic Rigidity
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathArt, Design & ArchitectureVisual Arts
Om kurset
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