Note 7, DM819, fall 2018

Exercises October 22

• Exercises 6.2, 6.5, 6.7, 6.8, 6.16.
• Show that it must take at least the order of n log n to compute a trapezoidal map (some model assumptions are required to make this formal, but take that lightly). Hint: reduce from sorting.
• In Exercise 6.2, we considered bad worst-case situations. Consider the three complexity issues of search time, construction time, and storage space. To what extent is it possible to have good performance on some of these while at the same time having bad performance on others?

Lecture October 23

• Interval Trees and Priority Search Trees (sections 10.0 - 10.2).