Work Note 10, DM819, fall 2011
Lecture November 11
-
Interval Trees and Priority Search Trees (sections 10.0 - 10.2).
Exercises November 15
-
Exercises 7.1, 7.2, 7.3, 7.5, 7.6, 7.10, 7.11.
-
Try to also find a divide-and-conquer algorithm that solves 7.10,
i.e., some approach that does not have anything to do with
Voronoi diagrams.
Last modified: Mon Nov 7 08:50:01 CET 2011
Kim Skak Larsen
(kslarsen@imada.sdu.dk)