Work Note 14, DM819, fall 2011

Lecture December 9

Exercises 14.5, 14.12, 14.13, 14.14.
In the balancing algorithm for quadtrees, which runs in O(dn), where n is the size of the tree, the O(d)-part is due to searches for neighbor nodes to check if they are more finely divided than the current node. Here, d denotes the height of the quadtree. Consider maintaining a constant amount of extra information in the internal nodes of a quadtree such that this information can be obtained in constant time, thereby reducing the time complexity of the balancing algorithm to O(n).

There will be a "pizza meeting" for all students at IMADA on Monday, December 5 at 16:15 in room U49. At the meeting, IMADA will give information about the bachelor projects and specific information on the elective courses planned for the next semester. The meeting will end with a free pizza, beer, and soft drink session.

Last modified: Tue Nov 29 15:58:51 CET 2011