搜索资源列表
zuijindiandui
- 算法分析里的最近点对问题的实现,一维的有传统的解决算法和分治技术解决的算法,及比较。附带实验报告
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.
divide.rar
- 分治法求解最近点对问题 求最近点对的分治算法实现,输入点对,输出最近点,Sub-rule method for nearest point on the nearest point on the issue of sub-rule algorithm, input points, output nearest point
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
- 求最近点对问题, 求最近点对问题。-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
nearestpoint
- 求最近点对的算法,使用分治法求解最近点对问题-For the nearest point of the algorithm, the use of sub-rule method to solve the problem nearest point
random
- 含有随机算法,素数测试,求最近点对的随机算法-Contains a random algorithm, prime number test, seek the nearest point of the random algorithm
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, according to the coordinates of
Nearest
- 分别利用分治法及穷举法求解最近点对问题,输出查找结果及比较次数。-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
dbPoint.c
- C语言实现,分治法求平面中任意个点的最近点对和最近距离。-C language implements, find out the shortest point pair and the shortest length between arbitrary points in a plane, with divide and conquer method.
CLOSESTPAIR
- 最近点对问题,求解平面上n个点的集合中距离最近的两点的距离。-Nearest point of the problem, solving the plane the set of n points in the distance between the nearest two points.
PointPair
- 根据分治算法实现求平面上最近点对的复杂度为(nlgn)的算法 有图形界面,能通过鼠标输入点-Under sub-rule algorithm seeking the nearest point on the plane of the complexity of (nlgn) algorithm for graphical interface, through mouse input points
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
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.