Class and Lecture Videos
Lecture 18: Gluing Algorithms
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
Course Info
Instructor
Departments
As Taught In
Fall
2012
Level
Topics
Learning Resource Types
theaters
Lecture Videos
assignment_turned_in
Problem Sets with Solutions
group_work
Projects
Instructor Insights
