Computational geometry

• How Does the Closest-Pair-of-Points Algorithm Work?
  The divide-and-conquer closest-pair algorithm finds the nearest two points in 2D in O(n log n) time by checking a narrow strip after each split.