搜索资源列表
divide.rar
- 分治法求解最近点对问题 求最近点对的分治算法实现,输入点对，输出最近点,Sub-rule method for nearest point on the nearest point on the issue of sub-rule algorithm, input points, output nearest point
Apoint
- 一维最近点对问题 通过输入一维点x的坐标，求得距离最近的点对和距离-One-dimensional nearest point of the problem by entering the coordinates of one-dimensional point x, obtained from the nearest point and distance
Geometer.rar
- 线段及直线的基本运算 1. 点与线段的关系 2. 求点到线段所在直线垂线的垂足 3. 点到线段的最近点 4. 点到线段所在直线的距离 5. 点到折线集的最近距离 6. 判断圆是否在多边形内 7. 求矢量夹角余弦 8. 求线段之间的夹角 9. 判断线段是否相交 10.判断线段是否相交但不交在端点处 11.求点关于某直线的对称点 12.判断两条直线是否相交及求直线交点 13.判断线段是否相交，
ICP
- ICP算法,主要用于三维点云数据的配准，最近点迭代算法，可以收敛到局部最小-registration of point cloud data,the iterated close point algorithm
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
SiftANN
- 实现了SIFT特征点的提取和匹配功能，匹配算法使用的是ANN最相似最近邻居法。-Achieved a SIFT feature point extraction and matching, matching algorithm using ANN is most similar to nearest neighbor method.
Graphics1
- 图形程序合集1：包括矩阵变换，2维裁剪，最近点求取等-Graphics program Collection 1: including matrix transformations, 2-D cutting, nearest point to strike, etc.
nearestneighbour
- 国外人写的三维最近点查找程序，采用该程序可以很快找到距某一点或一组点最近的n个点。-Foreign people to write three-dimensional nearest point search procedure, the use of the program can be quickly found from a point or a group of points, the most recent n points.
fenglong07323206
- 一个菜单界面，分别用菜单命令来绘制原数据曲面图，线性插值，最近点插值，3次多项式插值，3次样条插值后的图形，每次插值都可以在同一图形界面下比较插值前后图形。-A menu interface, respectively, using the menu command to map the original data surface map, linear interpolation, nearest point interpolation, polynomial interpolation 3
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 the ability to automatically gen
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.
KitBag
- 分治法和蛮力法求解最近点对问题,不好意思中文传不了，改传背包问题了。-leastport
CLOSESTPAIR
- 最近点对问题，求解平面上n个点的集合中距离最近的两点的距离。-Nearest point of the problem, solving the plane the set of n points in the distance between the nearest two points.
Divfuntion
- 算法分析实验 算法分析分治法 最近点对问题-Experimental analysis of algorithms analysis of algorithms divide and conquer the nearest point of the problem