Lecture 13: Perimeter halving, gluing trees, rolling belts, exponential number of gluings, dynamic-programming algorithm for edge-to-edge gluing
Page 4: Edge-to-edge gluing, easy in the generic case, polynomial-time dynamic program for decision problem
You can view the original Lubiw and O'Rourke paper that studied efficient algorithms to find edge-to-edge gluings.
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
[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]