Lecture 3: Rigidity theory, generic rigidity, minimal generic rigidity, Henneberg characterization, Laman characterization, polynomial-time algorithm
Page 6: Polynomial-time algorithms for testing Laman conditions, pebble algorithm, bipartite-matching algorithm, open problem to improve
Michael Thorpe is one of the people applying Laman conditions, studying the flexibility of proteins. In particular, I showed Figure 1 from this article showing the flexibility of the HIV protease with and without an inhibitor.
You can download the paper by Jacobs and Hendrickson describing the pebble algorithm, and the paper by Hendrickson describing the bipartite-matching algorithm.
These are rough, personal lecture notes handwritten by Erik Demaine used during lecture. Their primary purpose is for reading/review by students of the class. Accessibility
[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]