The average performance analysis of a closest‐pair algorithm
Ruei‐Chuan Chang, R. C. T. Lee · International Journal of Computer Mathematics · 1984
Bentley proposed a divide‐and‐conquer approach to solve the planar closest pair problem. In this paper, we shall show that the average case performance of this algorithm is proportional to the number of poins being examined.