搜索资源列表
closestpair
- 最近点对问题，求解平面上n个点的集合中距离最近的两点的距离。-Nearest point of the problem, solving the plane the set of n points in the distance between the nearest two points.
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
- 在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