An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem.

Christian Schwarz, Michiel H. M. Smid

Browse the full SODA paper archive.