Lecture 18: Gluing Algorithms

Name: Lecture 18: Gluing Algorithms
Uploaded: 2014-08-26T13:24:00Z
Duration: 1 h 21 min 11 s
Description: Description: This lecture begins how to construct a gluing tree. Combinatorial bounds and algorithms are proved for gluing results, which include the general case, edge-to-edge, and bounded sharpness. The different gluings for the cross are also shown. Speaker: Erik Demaine

1:21:11

Description: This lecture begins how to construct a gluing tree. Combinatorial bounds and algorithms are proved for gluing results, which include the general case, edge-to-edge, and bounded sharpness. The different gluings for the cross are also shown.

Speaker: Erik Demaine