6.885: Folding and Unfolding in Computational Geometry (Fall 2004)

Prof. Erik Demaine

Lecture 2 -- Page 4 -- 150 DPI

[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]

Switch to 50 DPI or 72 DPI or 100 DPI or 150 DPI or 200 DPI

Lecture 2: Linkages, configurations, configuration space, trace; Kempe Universality Theorem, his proof, the bug; topological universality; signing your name

Page 4: Translator, bug, efficiency and generalization questions, topological universality

You can download the paper by Gao, Zhu, Chou, and Ge on polynomial bounds and algorithms for Kempe linkages and a generalization to 2D surfaces in 3D.

These are rough, personal lecture notes handwritten by Erik Demaine used during lecture. Their primary purpose is for reading/review by students of the class. Accessibility

Printable PostScript (requires Level-2 PostScript)

[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]

Switch to 50 DPI or 72 DPI or 100 DPI or 150 DPI or 200 DPI