搜索资源列表
最近点对
- 这是一个经典的寻找最近点对的算法实现，运用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.
求解最近点对
- 利用二分法算法求解最近点对
最近点对问题
- 图像界面 演示最近点对问题
ClosestPairPoint
- 实现查找一组给定点中的最近点对，通过分治方法将问题求解，简化问题的复杂性。-Lookup a group to the latest sentinel points right, adoption of the partition method of problem solving, simplifying the complexity of the problem.
最近点对
- 这是一个经典的寻找最近点对的算法实现，运用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.
ndp_src
- 用pascal实现寻找最近点对问题，以方便对pascal较熟悉的学习者参考。-used to find the nearest point on the issue, to facilitate the pascal more familiar reference learners.
计算几何算法
- 计算几何常用算法，包括点是否在多边型中，判定两条直线是否相交，平面最近点对-computational geometry algorithm commonly used, including whether a multilateral type in determining whether the intersection of two straight, the nearest point on Plane
zjdd
- VC++的“最近点对问题”，-VC "point to the recent problems," Guangguang 04:40
sgj3
- 考察例1 4 - 8中的1 4个点。A中的最近点对为(b,h)，其距离约为0 . 3 1 6。B中最近点对为 (f, j)，其距离为0 . 3，因此= 0 . 3。当考察 是否存在第三类点时，除d, g, i, l, m 以外 的点均被淘汰，因为它们距分割线x= 1的 距离≥ 。RA ={d, i, m}，RB= {g, l}，由 于d 和m 的比较区中没有点，只需考察i 即可。i 的比较区中仅含点l。计算i 和
NNP
- 最近点对问题，输入数据生成器自动生成2位点对，输出制定电的最近邻-nearest point of the problem, the input data generator automatically generate two points right, electrical output of the nearest neighbor
zuijindiandui
- 算法分析里的最近点对问题的实现，一维的有传统的解决算法和分治技术解决的算法，及比较。附带实验报告-Algorithm analysis in the nearest point on the question of the realization of the traditional one-dimensional solution algorithm and technology solutions division of the a
problem3
- 最近点对的随机算法 算法时间达到O(n)非常完美的实现了随机最近点对的功能-Nearest point algorithm for a random time algorithm to achieve O (n) is the perfect realization of a random nearest point on the function of
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 w
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
nearestPointPair
- 给定一个点数组，比较求解最近点对的一般算法和分治法的效率。-Given a point group, compared to solve the nearest point on the general algorithm and divide and conquer efficiency.
closest
- VC++最近点对用图形界面实现,大家可以学习一下，可能会存在一些缺陷-VC++ with the nearest point on the graphical interfaces
最近点对
- 已知平面上有n个点，点为二维数组，求平面上的最近点对。(Find the nearest point pair on the plane)
平面内最近点对
- 分治算法练习，使用分治算法实现计算平面内最近点对距离。子问题将平面划分为左右两部分分开计算最短距离，再在中间条带中找是否有更近点对。(Divide and conquer algorithm to calculate the closest point pair in the plane)
最近点对
- vs2010 c++解决最近点对问题，适合初学者(closest pair, for beginners)