Possibly Related Publications

The following publications are possibly variants of this publication:

• An Optimal Algorithm for the On-Line Closest-Pair ProblemChristian Schwarz, Michiel H. M. Smid, Jack Snoeyink. compgeom 1992: 330-336 [doi]
• An O(n log n log log n) Algorithm for the On-Line Closest Pair ProblemChristian Schwarz, Michiel H. M. Smid. soda 1992: 280-285 [doi]
• Sequential and parallel algorithms for the k closest pairs problemHans-Peter Lenhof, Michiel H. M. Smid. ijcga, 5(3):273-288, 1995.
• Data structures and algorithms for the dynamic closest pair problemChristian Schwarz. PhD thesis, Saarland University, Saarbrücken, Germany, 1993. [doi]
• Simple Randomized Algorithms for Closest Pair ProblemsMordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid. cccg 1993: 246-251
• Simple Randomized Algorithms for Closest Pair ProblemsMordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid. njc, 2(1):3-27, 1995.