Lecture 10: Kempe's Universality Theorem

preview_player
Показать описание
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012
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
Рекомендации по теме