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
Course Info
Instructor
Departments
As Taught In
Fall
2012
Level
Learning Resource Types
Instructor Insights
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
group_work
Projects
