1. (Text, exercise 2.8): Give pseudocode for an algorithm that lists all
   vertices incident to a given vertex v in a doubly-connected edge
   list.

2. (Text, exercise 2.10): Let S be a subdivision of the plane into
   polygons, described as a doubly connected edge list with n objects,
   and let P be a set of m points, none of which lies on an edge or
   vertex of S. Describe a plane sweep algorithm that computes for every
   point of P the face of S in which it is contained, and show that your
   algorithm runs in time O((n+m) log (n+m)).

3. (Text, exercise 8.14): Let S be a set of n points in the plane. Give
   an O(n^2) time algorithm to find the line containing the maximum
   number of points in S. (Hint: transform the problem into one on the
   dual line arrangement.)