[+] Rigidity theory: Pebble algorithms, rigid component decomposition, bodyandbar framework, angular rigidity, 5connected double bananas. 

This class focuses on one main question: how exactly and why does that
pebble algorithm detect Laman's condition for minimal generic rigidity?
We'll start with a simpler version of the algorithm that tests whether
every k vertices induce at most 2k edges, and then extend
to the needed 2k − 3 condition.
Then I'll mention several extensions:

Handwritten notes, page 1/5 •
[previous page] •
[next page] •
[PDF]
Handwritten notes, page 1/5 • [previous page] • [next page] • [PDF] 

Slides, page 1/10 •
[previous page] •
[next page] •
[PDF]
Slides, page 1/10 • [previous page] • [next page] • [PDF] 
The video above should play if your web browser supports either modern Flash or HTML5 video with H.264 or WebM codec. The handwritten notes and slides should advance automatically. If you have any trouble with playback, email Erik.