搜索资源列表
一维最近点（分治法）1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the proble
一维最近点（分治法）2
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法(找出中位数,两边递归）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : the administration (to identify the median on both sides, the re
一维最近点（传统法）1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：计算每对顶点间的距离，比较之 效率为O(n2)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : for each pair of vertices the distance, a comparison of t
一维最近点（传统法）2
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：传统方法2:先排序，然后一次线性扫描，得到最近距离，时间复杂性O（nlogn）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : The traditional two methods : first order
ClosestPairPoint
- 实现查找一组给定点中的最近点对，通过分治方法将问题求解，简化问题的复杂性。-Lookup a group to the latest sentinel points right, adoption of the partition method of problem solving, simplifying the complexity of the problem.
ndp_src
- 用pascal实现寻找最近点对问题，以方便对pascal较熟悉的学习者参考。-used to find the nearest point on the issue, to facilitate the pascal more familiar reference learners.
最近距离
- 距离最近的点对计算方法-a program for get the shortest path of two points.
二维最近点
- 该程序实现对二维数据轴上的最临近点的求解问题 采用方法：分治方法-procedures to achieve the two-dimensional data of the axis points near the methodology used to solve the problem : the administration
一维最近点（分治法）1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the proble
一维最近点（传统法）1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：计算每对顶点间的距离，比较之 效率为O(n2)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : for each pair of vertices the distance, a comparison of t
一维最近点（传统法）2
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：传统方法2:先排序，然后一次线性扫描，得到最近距离，时间复杂性O（nlogn）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : The traditional two methods : first order
shortest_BySophia
- 给定平面上N个点，找其中的一对点，使得在N个点组成的所有点对中，该点对间的距离最小。-given plane N and find the one pair of points made in the composition of N points on all points, which points to the distance between the smallest.
icpCpp
- 迭代最近点算法的c++代码，可以对3D数据进行对齐-Iterative nearest point algorithm c++ Code, can be aligned to the 3D data
computationgeometry
- 我的计算几何模板，求3d凸包，计算最远点对（nlogn），求最近点对，和二维凸包-Computational geometry to my template, and 3d convex hull calculation of farthest point of (nlogn), for nearest point right, and two-dimensional convex hull
Nearestpoint
- 求最近点对问题， 求最近点对问题。-Nearest point on the issue of demand, and the nearest point on the issue, and the nearest point on the issue.
Nearestpoint
- 最近点对算法的实现，用穷举法证明程序的正确性。-Nearest point of the algorithm, the exhaustive method to prove the correctness of the procedure.
Cpair
- 最近点对算法，穷举法证明算法的正确性，可供学习和参考-Nearest point of the algorithm, exhaustive method to prove the correctness of algorithms for learning and reference
random
- 含有随机算法，素数测试，求最近点对的随机算法-Contains a random algorithm, prime number test, seek the nearest point of the random algorithm
ClosetPair
- 实现求解平面最近点对的复杂度为nlgn的算法。程序要求能够自动生成至少100万个点，并利用该算法求解。此外，要求支持图形界面的算法输入与输出。在此基础上，添加n^2级算法的实现，并比较相同规模下，两种算法的时间消耗。-Solving the nearest point on the plane to achieve the complexity of the algorithm for nlgn. Program requires th
devide_conquer
- 分治法解最近点对问题：首先输入点的个数，然后输入点的坐标，输出先是根据x的坐标对点进行排序，然后输出最近点对的距离。-Divide and conquer solution of the nearest point of the problem: First, the number of input points, and then enter the coordinates of points, the output first, a