CS 266 - Computational Geometry Homework 6, 50 Points
Due: Wednesday, May 18, 2011
-
10 points.
Suppose you are given two sets, A and B, of n points each. Describe
an O(n log n)-time algorithm to find the nearest neighbor in B for
each point in A.
-
10 points.
Problem 7.5 from de Berg et al.
-
10 points.
Problem 7.7 from de Berg et al.
-
10 points.
Problem 7.11 from de Berg et al.
-
10 points.
Problem 7.16 from de Berg et al.