Video details loaded
HomeMIT 6.849 Geometric Folding Algorithms, Fall 2012Lecture 10: Kempe's Universality Theorem

Lecture 10: Kempe's Universality Theorem

1:18:19

Description: 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.

Speaker: Erik Demaine