搜索资源列表
ICP
- ICP迭代最近点算法的使用,使用matlab实现了ICP迭代最近点算法的方针,还包括了四元函数法和线性约束等基本方法的代码实现。-Iterative closest point ICP algorithm for the use of matlab to achieve the iterative closest point ICP algorithm approach, including the quaternary function method and the linear constr
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
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.
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
nearestpoint
- 使用vc++解决平面上最近点的求解问题,使用的是递归算法,时间复杂度较高-Using vc++ to solve the nearest point on the plane to solve the problem, using a recursive algorithm, time complexity of a high
Nearest_neighbours_and_kD_trees
- 利用kd树寻找多维空间最近点的英文书籍,有利于学习ICP算法!-Multidimensional space using kd tree to find the nearest point of the English books is conducive to learning ICP algorithm!
suanfa
- 请选择操作: 1. 最近点对 2. 假币问题 3. 堆排序 4. 全源最短路径-Please choose: 1. Nearest points on 2. Counterfeiting problem 3. Heap sort 4. All source shortest path
pairdistance
- 在C语言环境下,实现寻找空间中最近点对的有效算法。-In the C language environment, to achieve search space, the nearest point on the efficient algorithm.
kdtree1.2
- kd-tree 是广泛用来处理多维寻找最近点的数据结构。该文件中是由matlab调用c++代码实现的,其中实现包括kd-tree的建立最近点的查找等。-kd-tree is kind of data structure which is widely used to find the nearest point in multi-demensions.The zip file contain matlab and cpp files.The functions implemented inclu
kdtree_in_matlab
- kd-tree 是一种常用的数据结构,它在搜索最近点中有普遍用处。该文件是一个用纯matlab写成的源代码。-kd-tree is a commonly used data structure, it is commonly used in searches for the nearest point. The file is a pure source code written in matlab.
fenzhifa
- 用c++实现分治法算法的最近点对问题(在VS2008平台上)-Using c++ implementation of divide and conquer algorithm for the nearest point of the problem (in VS2008 platform)
Thenearestpointofthealgorithm
- 最近点对的算法实现,希望大家互相学习,提建议。希望对您有帮助-The nearest point of the algorithm, I hope you learn from each other suggestions. I hope for your help
zuijindianwenti
- 这是我自己写的一个归并排序实现的最近点对问题的算法实现 -This is what I had written a merge sort to achieve the nearest point algorithm for the problem ~ ~
geometric
- 一个 CREWES集合工具箱,包括对例如距线的最近点和polygon中的点路径问题,对观测系统有用-A CREWES collection kit, including for example, the nearest point from the line and polygon point in the path problem, a useful observation system