A Simple Randomized Sieve Algorithm for the Closest-Pair Problem

We present a linear time randomized sieve algorithm for the closest-pair problem. The algorithm and its analysis are simple. The algorithm is extended to obtain a randomized linear time approximation algorithm for the closest bichromatic pair problem.

[1]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Kenneth L. Clarkson,et al.  Fast algorithms for the all nearest neighbors problem , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[5]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[6]  Michael Ian Shamos,et al.  Divide-and-conquer in multidimensional space , 1976, STOC '76.

[7]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[8]  John E. Hopcroft,et al.  A Note on Rabin's Nearest-Neighbor Algorithm , 1978, Inf. Process. Lett..

[9]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[10]  Michiel H. M. Smid,et al.  Randomized data structures for the dynamic closest-pair problem , 1998, SODA '93.

[11]  Pravin M. Vaidya,et al.  AnO(n logn) algorithm for the all-nearest-neighbors Problem , 1989, Discret. Comput. Geom..

[12]  Otfried Cheong,et al.  Euclidean minimum spanning trees and bichromatic closest pairs , 1990, SCG '90.

[13]  Andrew Chi-Chih Yao.  Lower Bounds for Algebraic Computation Trees with Integer Inputs , 1991, SIAM J. Comput..

[14]  Klaus H. Hinrichs,et al.  Plane-Sweep Solves the Closest Pair Problem Elegantly , 1988, Inf. Process. Lett..

[15]  Michiel H. M. Smid,et al.  An optimal algorithm for the on-line closest-pair problem , 1992, SCG '92.

[16]  Yossi Matias.  Semi-dynamic Closest-pair Algorithms , 1993, CCCG.

[17]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[18]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .