| Title | : | Lecture 11: Rigidity Theory |
| Duration | : | 01:24:39 |
| Viewed | : | 0 |
| Published | : | 26-08-2014 |
| Source | : | Youtube |
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012
View the complete course:
ocw.mit.edu/6-849F12
Instructor: Erik Demaine
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.
License: Creative Commons BY-NC-SA
More information at
ocw.mit.edu/terms
More courses at
ocw.mit.edu/
SHARE TO YOUR FRIENDS
Scan me
