Lecture 18: Gluing Algorithms

Published: June 24, 2015, 8:13 p.m.

This lecture begins with 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.