Work Note 9, DM819, fall 2009

Discussion Section November 17

• 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.

Lecture November 20

• Segment Trees (section 10.3).

Announcements

• The scheduled lecture on Friday, November 10, was cancelled. We shift everything, so on November 13, we cover Interval Trees and Priority Search Trees, and on November 17, the already announced exercises related to Chapter 7.