MIT
Lecture 11: Rigidity Theory
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathArt, Design & ArchitectureVisual Arts
Om kurset
Description: This lecture begins with a review of linkages and classifying graphs as generically rigid or flexible. Conditions for minimally generic rigid graphs are presented with degree-of-freedom analysis. Proofs of Henneberg and Laman characterizations are given. Speaker: Erik Demaine