搜索资源列表
CLOSESTPAIR
- 使用分治算法找到平面上的n各点的集合S中最小距离的一个点对-Use Divide and Conquer Algorithm to find the plane of the set of n points S in the minimum distance of a point on the
brutforce
- a ClosestPair code which is writen with BrutForce
DivideandConquer
- a ClosestPair code writen with divideandconquer
closestPair
- 源程序实现最近匹配算法,从众多点中找到一对举例最近的点。-Look for the closest pair