Work Note 8, DM819, fall 2009
Lecture November 10
-
Interval Trees and Priority Search Trees (sections 10.0 - 10.2).
Discussion Section November 13
-
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 which does not have anything to do with
Voronoi diagrams.
Announcements
-
The scheduled lecture on Friday, November 6, has been cancelled.
-
The biannual IMADA party, matalogifesten, takes place Friday,
November 13. Sign-up is no later than Tuesday, November 10.
See
http://imadafagraad.dk/matalogifest/ for details.
Last modified: Wed Nov 4 14:57:30 CET 2009
Kim Skak Larsen
(kslarsen@imada.sdu.dk)