Algorithms for Finding the Closest Pair of Points
Zhongbo Wu · Computer Knowledge and Technology · 2007
In this paper we describe the problem of finding the closet pairs of points in the plane and we use three algorithms to solve this problem including na?ve algorithm, divide and conquer algorithm and plane sweep algorithm. At last we analyze the efficiency of these algorithms.