Problem
1. Give an algorithm for finding the closest pair from a set of lines.
2. Draw the voronoi diagram and its dual for the points A B C D E F from the sample point set.
3. Give a "brute-force" method (which might require time proportional to /V2) for computing the voronoi diagram.
4. Write a program that uses the same recursive structure as the closest-pair implementation given in the text to find the convex hull of a set of points.