搜索资源列表
nearestpoint
- 随机在二维平面上生成一千个点,再利用分治算法计算这一千个点中的最近点对,并返回这两个点的距离和坐标-Randomly generated on a two-dimensional plane a thousand points, and then use divide and conquer algorithm to calculate these thousand points of the nearest point on, and return from, and coordinate t
GA
- 遗传算法简单实现C语言实现,计算三点之间最近点的模型-Genetic algorithm implemented by C language
ClosestPair
- 平面最近点对问题是计算几何学中研究的基本问题之一。假设在平面S上有n个点,在这n个点所组成的点对中,寻找距离最近点对问题。例如:有两点 与 。它们之间的距离为: 。n个点可以组成 个点对,找其中的一点对,使得在n个点组成的所的点对中,该点对的 为最小。-Plane closest point to the problem is one of the basic problems of research in computational geometry. Suppose there are n
voronoi
- 从Voronoi结构所脱胎的计算几何来看,Voronoi图是对平面n个离散点而言的,它把平面分为几个区,每一个区包括一个点,该点所在的区是到该点距离最近点的集合。-From the perspective of a Voronoi structure have spun out of the computational geometry, Voronoi diagram is for plane n discrete points, it put the plane is divided int
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
icpCpp
- 在matlab平台上实现了迭代最近点算法(ICP),功能齐全-a full-featured iterative closest point algorithm (ICP) achieved On matlab platform successfully
icp
- 迭代最近点算法的matlab源码,可以实现对3维点数据的对齐-Iterative closest point algorithm matlab source, can achieve the alignment of the three-dimensional point data
icp(C)
- C/C++实现ICP(迭代最近点算法),实现三维点数据的对齐-using C/C++ to achieve ICP (iterative closest point algorithm), to achieve a three-dimensional point data alignment
ICPdemo_test
- 迭代最近点(ICP)算法 包括Kd-tree搜索实现-Iterative Closest Point (ICP) algorithm includes Kd-tree search implementation
NearestTnterpolation
- matlab最近点插值程序,通过这个程序可以实现影像配准前需要进行的匹配工作-matlab nearest point interpolation procedure, this procedure can be achieved by matching image registration work needs to be done before
ICP_test
- VS 2010 ICP 迭代最近点算法 纯C-VS 2010 ICP C++
cube_texture
- vs2012下,opengl纹理贴图,使用线性采样和最近点采样-opengl cube texture
sy4
- 数据结构最近点问题,一个很好用简单的算法-Closest point data structure, a useful and simple algorithm
cubes
- 对正方体加载纹理。使用三种纹理过滤方式加载纹理(线性采样、mipmap和最近点采样)。各个面的纹理不同。鼠标右键弹出式菜单控制纹理过滤方式的切换。-The cubes loaded textures. Using three kinds of texture filtering way load (linear sampling, mipmap and closest point sampling). All the different texture. The right mouse butt
ClosetPairOfPoints
- 求平面点集最近点对,算法导论课程实验,基本实现,可借鉴-For the nearest point on the plane point set, introduction to algorithms course experiment
suanfa
- 利用分治算法和蛮力算法求最近点对的长度问题-Use divide and conquer algorithm and a brute-force algorithm for the nearest point on the length of the problem
DivideConquer
- 一个实现平台最近点对问题的算法作业代码。-An implementation platform closest point algorithm for the job code.
ClosestPairPoint
- 最近点对算法的实现,用java编写,可以直接使用-The nearest point on the implementation of the algorithm, using java, you can directly use
the-k_nearst-alogrithm
- 一种快速搜索散乱点云数据 k 邻近的算法 对逆向工程中散乱点云数据的 k 近邻搜索,提出一种快速搜索散乱点云 k 邻近点的算法。该算法根据 点云数据的范围、点的总数及最近点数目 k,确定合适的立方体边长,采用空间划分策略,把数据划分成多个子立方体; 然后用哈希表记录每个子立方体所包含的数据点及每个点所在的立方体索引号,并排除不包含数据的子立方体,以此 确定邻近点的最佳搜索范围。实验结果表明:该算法有效的提高 k 近邻搜索的速度,同时保证了搜索结果的正确性。 -a fast m
ICPdianyunpipei
- 对两组点云数据进行ICP匹配,最近点迭代法,进行点云匹配,含有两组点云数据-Two sets of point cloud data for ICP match