搜索资源列表
POINT
- 用分治法找一个平面内的最接近点对。时间复杂度为O（nlogn）.-Using a divide and conquer to find the closest point of the plane pair. Time complexity is O (nlogn)
Pair
- 完成一维，二维，的最接近点对问题，还有界面-Complete the one-dimensional, two-dimensional, the closest point on the issue, as well as the interface
theClosestPoint
- 寻找平面中最接近的点对，利用算法使时间复杂度接近于O（nlogn）-Find the the plane closest point pair algorithm time complexity close to O (nlogn)