搜索资源列表
Fib
- 算法分析基础——Fibonacci序列问题 分治法在数值问题中的应用——最近点对问题 减治法在组合问题中的应用——8枚硬币问题 变治法在排序问题中的应用——堆排序问题-The basis of algorithm analysis- Fibonacci sequence divide and conquer the problem of the numerical problems- the nearest point on the issue by governing law in
closed_point
- 最近点对的算法: 对给定数量的点,求其中点对的最短距离。(测试样本为1000,5000个点,跑出来的时间均为0(s))详细思路请看程序注释。-The nearest point of the algorithm: for a given number of points, find the point where the shortest distance. (1000,5000 the test sample points, running out of time are 0 (s))
ClosestPoints
- 暴力法和递归法求解最近点对问题(带图形界面)-Violence Act and the nearest point of a recursive method for solving the problem (with GUI)
closed-points
- 二维最近点对递归算法,最大点对为10000对-Two-dimensional nearest point of the recursive algorithm, the maximum point of the 10,000 pairs
Closest-Pair-Point
- 寻找最近点对(... ... ... ... ... ... ...)-find closest path pair (.....................................)
closetpair
- 最近点算法,求若干个点之间的最近点对间的距离,给出横纵坐标!-Nearest point algorithm, find the number of points between the nearest point of the distance between the vertical and horizontal coordinates are given!
NearestPoint
- 使用分治法实现最近点对算法,图形化界面,可以通过鼠标点击生成点也可以随机生成,并计算得到最近点对-Divide and conquer method to achieve the closest point algorithm, graphical interface, can be generated by a mouse click can also be randomly generated, and calculated to the nearest point on
Ask-the-nearest-point
- 求最近点对点算法,关于如何求解最近的点对点问题的算法-Ask the nearest point of the algorithmAsk the nearest point of the algorithm
lab22
- 首先,定义两个对象一个定义了点的x,y坐标和它的标号,另一个对象是两点之间的距离。然后用冒泡比较法对点的x,y坐标分别进行排序,编写控制台程序,输入点的个数,分为两种方法求最近点对。根据点的个数分为3个点的情形和大于3个点的情形,3个点的直接对两两点之间的距离进行比较。大于3点的用分治递归法求解,通过划定界限分8块没一点只对其他7块内的点进行比较长度最后求出最短距离。-First of all, define two object a definition of a x, y and its l
icp
- 迭代最近点算法,用于匹配数据点集。matlab实现-Iterative closest point algorithm is used to match the data points. matlab implementation
ICP_14900012
- ICP迭代最近点算法的各种实现方法,包括四元函数法,最小迭代,等算法,以及ICP迭代最近点算法的实现。-ICP iterative closest point algorithm implementation, including the four-function method, the minimum iteration algorithm, and ICP iterative closest point algorithm.
pfzjd
- 借助最优化和支持向量机中的平分最近点法来解决问题-With optimization and support vector machine bisects the nearest point to solve the problem
ICP
- 本程序使用matlab语言,实现了最近点迭代算法(ICP);在matlab直接调用该文件中的函数名即可使用。-This program uses the Matlab language, the nearest point iterative algorithm (ICP) matlab directly call a function in the file name can be used.
kdtree
- 完整实现了数据的kdtree划分,适用于最近点搜索,验证可用。-Full implementation of the data kdtree division, search for the nearest point to verify availability.
icp
- 迭代最近点算法的完整Matlab程序,输入两个点集,输出旋转矩阵、平移向量和整体误差,验证可用。-Complete iterative closest point algorithm Matlab program, enter the two point sets, the output rotation matrix and translation vector and the overall error, verify availability.
x
- ★问题描述: 给出平面上的N 个二维点,求出距离最小的2 个点对。本题中距离定义为他们的直 线距离。例如(0,0) (3,4)的距离为5. ★数据输入: 有多组数据,对于每组数据,第一行是一个数字N 表示点的个数。N=0 的时候说明 输入结束。之后N 行,每行有2 个浮点数x_i,y_i 表示第i 个点的坐标。(1<=N<=10000 0,0<=|x_i|,|y_i|<=10^9) ★结果输出: 输出一个浮点数,表示最近点对的距离除以2,保
GA
- 遗传算法简单实现C语言实现,计算三点之间最近点的模型-Genetic algorithm implemented by C language
algorith4
- 用分治法解决最近点对问题,就是将一个问题分解两个子问题,然后递归处理子问题,然后合并求出最短距离-Solve the problem closest point using divide and conquer method is to decompose a problem of two sub-problems, and then recursively processing sub-problems, and then find the shortest distance merge
icp
- 迭代最近点算法的matlab源码,可以实现对3维点数据的对齐-Iterative closest point algorithm matlab source, can achieve the alignment of the three-dimensional point data
ICPdemo_test
- 迭代最近点(ICP)算法 包括Kd-tree搜索实现-Iterative Closest Point (ICP) algorithm includes Kd-tree search implementation