MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Class 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 axiom compass construction folding motion hole hypar kempe linkage peaucellier polynomial set

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 class presents open problems involving holes, sliding linkages, and generalizations of Kempe. A proof for the semi-algebraic sets for Kempe is presented and various origami axioms are given. The class ends with a continuation of hypar folding. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu