Work Note 10, DM819, fall 2009

Discussion Section November 24

• Problems 2 and 4 from the Winter 1999/00 exam set.
• Solve the problem of finding the set of dominating points from Problem 2 above in O(n log n) using a divide-and-conquer strategy. Hint: consider the point with the largest y-value to the right of the x-median.
• Try to come up with a heuristic for computing convex hull faster in practice. The algorithms we have are O(n log n), but maybe one could use O(n) time to rule out a lot of points and then only run the convex hull algorithm on a much smaller set of point. Try to program the convex hull algorithm from Chapter 1 and your newly designed algorithm and time them on a very large number of uniformly distributed points.

Lecture November 27

• Binary Space Partitions (section 12.0 - 12.3).

Announcements

• There will be a "pizza meeting" for all students of IMADA on Monday, November 23 from 16:15 to 18:30 in room U49.

  At the meeting, IMADA will give general information on the bachelor and candidate studies, and specific information on the elective courses in mathematics and computer science planned for the next semester.

  The meeting will end with a free pizza, beer, and soft drink session.