MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Lecture 11: Rigidity Theory

4.0 (0)

5 learners

What you'll learn

This course includes

42.5 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

6-849-geometric-folding-algorithms-linkages-origami-polyhedra-fall-2012 algorithm degree of freedom flexible generic henneberg laman linkage minimally generic pebble rigidity

Full Transcript

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://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 http://ocw.mit.edu/terms More courses at http://ocw.mit.edu