分治法解决空间最接近点对问题

Resolving the Problem of Closest Pair in Three-dimension Space Using Divide-and-conquer Method

使用分治法解决空间最接近点对问题,对合并的步骤加以改进,可以得到时间复杂度为O(nlogn)的算法,在计算时可节省大量时间.

This paper uses divide - and - conquer method to resolve the problem of closest pair in three - dimension space. An 0 （nlogn） algorithm is presented through discussing the merging step.