MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Lecture 10: Kempe's Universality Theorem

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 additor configuration contraparallelogram equivalence folded state folding motion gadget graph kempe linkage multiplicator

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 by defining folding motion by a series of folded state, linkages, graphs, and configuration space. A proof of Kempe's Universality Theorem is presented along with Kempe's gadgets, and also the Weierstrass Approximation Theorem. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu