Discussion:

1.  Algorithm Improvement
    a. Can we think out an algorithm without any post-processing?
	   i.e., find the candidate immediately (e.g., design an algorithm
	         to make sure that, after inserting the points in the candidate list,
			 all points in the list must be in the output).

2. Definition
   a. minMaxDist may not be used correctly
      We should use the lower bound of the furthest pt

3. New Problem 
   a. Each possible site can be associated with a "polluting" region.
      The problem becomes to find a site which minimize the number of
	  residents inside the region
   b. Middle neighbor
      - meeting within a group

   c. Uncertain data

   d. Combine different queries into a single framework

   e. k-th furthest neighbor