CS 266 - Computational Geometry Homework 6, 50 Points
Due: Monday, February 29, 11:55pm

Assignments must be typed and turned in using the EEE system.

  1. 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.
  2. 10 points. Problem 7.5 from de Berg et al.
  3. 10 points. Problem 7.7 from de Berg et al.
  4. 10 points. Problem 7.11 from de Berg et al.
  5. 10 points. Problem 7.12 from de Berg et al.