搜索资源列表
最近点对
- 这是一个经典的寻找最近点对的算法实现，运用VC编写，采用类的方式，是程序更易理解。-This is a classic look for the nearest point of the algorithm, using VC preparation, the type used, the way the process easier to understand.
求解最近点对
- 利用二分法算法求解最近点对
最近点对问题
- 图像界面 演示最近点对问题
最近点对问题，分别用蛮力法和分治法进行了求解
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-Nearest point on the issue, respectively, and with brute force method for solving divide and conquer algorithm optimization has been done
ClosestPair 二维最近点对算法
- 二维最近点对算法，分别用遍历方法和分治算法实现，并对实现的时间进行比较-Two-dimensional nearest point of the algorithm, respectively, and partition with traversal algorithm, and compare the time to achieve
nearestPointPair
- 给定一个点数组，比较求解最近点对的一般算法和分治法的效率。-Given a point group, compared to solve the nearest point on the general algorithm and divide and conquer efficiency.
firstproblem
- 最近点对问题的图形界面实现，用户可以通过鼠标输入点集，也可以通过随机生成点集，程序会将最近的两个点用红色标示出来-Nearest point on the question of the realization of a graphical interface, users can mouse input point set, can also be randomly generated point set, the program will be the two most recent poi
pointNear
- 分治法解决最近点对问题，包括两种情况，考虑边界内四个点-Sub-rule method to solve the nearest point on the issues, including the two situations, consider the four-point boundary
nearestpoint
- 求最近点对的算法，使用分治法求解最近点对问题-For the nearest point of the algorithm, the use of sub-rule method to solve the problem nearest point
closest
- VC++最近点对用图形界面实现,大家可以学习一下，可能会存在一些缺陷-VC++ with the nearest point on the graphical interfaces
NearestPoints
- 分别利用分治法及穷举法求解最近点对问题，输出查找结果及比较次数。-Use, respectively, sub-rule method and brute-force method for solving the nearest point of the problem, the output and compare the number of search results.
zjdd
- 用于计算二维平面上一个点集的最近点对，可以计算100000个点的规模-Used to calculate the two-dimensional plane, a set of points the last points, we can calculate the size of 100000 points
zuijindian
- 这是我自己写的一个最近点对的问题的算法实现 -This is my own point of writing of a recent algorithm for the problem ~ ~
closepair
- 二位平面中求最近点对的问题，采用分治的方法，按照书本的算法实现-Two nearest points on the plane ask the question, the use of divide and conquer approach, in accordance with the books of the algorithm
最近点对
- 已知平面上有n个点，点为二维数组，求平面上的最近点对。(Find the nearest point pair on the plane)
最近点对
- vs2010 c++解决最近点对问题，适合初学者(closest pair, for beginners)
ClosestPair
- 求解平面最近点对，分治经典题目。。。。。。。(The program to solve the nearest point pair of the plane, divide and conquer the classic topic.)
closest_pair_of_points
- C++11标准下编写的平面最近点对算法，包括暴力算法与O(nlogn)的算法。使用纯面向对象的方式编写，提供了测试类。(The plane closest point pair algorithm based on C++11 standard, including the algorithm of violent algorithm and O (nlogn). Written in a purely object-oriented way, it provides test classes.
平面内最近点对
- 分治算法练习，使用分治算法实现计算平面内最近点对距离。子问题将平面划分为左右两部分分开计算最短距离，再在中间条带中找是否有更近点对。(Divide and conquer algorithm to calculate the closest point pair in the plane)
最近令近点对
- 用C++实现最近邻近点对，利用算法导论的知识实现最近邻近点对问题(Using C++ to implement nearest neighbor pairs, we use the knowledge of algorithm introduction to realize nearest neighbor point pairs.)