搜索资源列表
ClosestPair 二维最近点对算法
- 二维最近点对算法，分别用遍历方法和分治算法实现，并对实现的时间进行比较-Two-dimensional nearest point of the algorithm, respectively, and partition with traversal algorithm, and compare the time to achieve
CLOSESTPAIR
- 最近点对问题，求解平面上n个点的集合中距离最近的两点的距离。-Nearest point of the problem, solving the plane the set of n points in the distance between the nearest two points.
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
- 算法分析与设计之CLOSESTPAIR算法实现-CLOSESTPAIR
CloseSTPair
- 分治算法，分离点对，计算最小距离，采用分而治之的策略，代码清新明了，易读性强-CloseSTPair: Complute the shortest distanse
CLOSESTPAIR
- 给定平面上的N个点，找出两个点使其间距最小，并求出其距离。-Given N points on the plane to identify the two points so that the minimum spacing to determine its distance.
closestPair
- 源程序实现最近匹配算法，从众多点中找到一对举例最近的点。-Look for the closest pair
closestpair
- 在visual C++环境中，使用分治策咯实现最邻近点对的查找，并返回最邻近点对距离的平方-In visual C++ environment using divide and conquer tactics to achieve find the nearest point, and returns the nearest point on the square of the distance
ClosestPair
- 使用两种方法求最近点对，分别是双重循环和分支法，可以运行，java代码。-closest pair