An Improved Algorithm for Finding the Closest Pair of Points
- 85 Downloads
As early as in 1975, Shamos and Hoey first gave an O(n lg n)-time divide-and-conquer algorithm (SH algorithm in short) for the problem of finding the closest pair of points. In one process of combination, the Euclidean distances between 3n pairs of points need to be computed, so the overall complexity of computing distance is then 3n lg n. Since the computation of distance is more costly compared with other basic operation, how to improve SH algorithm from the aspect of complexity of computing distance is considered. In 1998, Zhou, Xiong and Zhu improved SH algorithm by reducing this complexity to 2n lg n. In this paper, we make further improvement. The overall complexity of computing distances is reduced to (3n lg n)/2, which is only half that of SH algorithm.
KeywordsShamos and Hoey algorithm divide and conquer closest pair of points complexity
Unable to display preview. Download preview PDF.
- 1.Shamos M I, Hoey D. Closest-point problems. In Proc. 16th IEEE Annu. Symp. Found. Comput. Sci., Berkeley, US, 1975, pp.151–162.Google Scholar
- 2.Franco P Preparata, Michael Ian Shamos. Computational Geometry: An Introduction, Springer-Verlag, 1985.Google Scholar
- 3.Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein. Introduction to Algorithms, Second Edition, MIT Press, 2001.Google Scholar
- 4.Alsuwaiyel M H. Algorithms Design Techniques and Analysis. World Scientific Publishing Press, 1999.Google Scholar
- 5.Yulin Zhou, Pengrong Xiong, Hong Zhu. An improved algorithm about the closest pair of points on plane set. Computer Research and Development, 1998, 35(10): 957–960. (in Chinese)Google Scholar