搜索资源列表
ClosestPointOnaLine_OpenGL
- 在Visual Studio 2008环境下,制作的一个Open_GL寻找任一点到线上另一个最近点的小程序,适合Open_GL初学者学习使用.-Finds closest point on a line to another point on the Visual Studio 2008 flatform, Open_GL for beginners to learn to use.
mincouplepoints
- 算法导论作业，求最近点对，vs2005，c++开发，复杂度o（nlogn）有图形交互界面，可以用鼠标设置点，也可以随机生成点，最多支持100万个点-Introduction to Algorithms job, find nearest points, vs2005, c++ development, complexity o (nlogn) with a graphical interface, you can set point with the mouse can also be rand
zuijindianwenti
- 这是我自己写的一个归并排序实现的最近点对问题的算法实现 -This is what I had written a merge sort to achieve the nearest point algorithm for the problem ~ ~
Efficient_Variants_of_the_ICP_Algorithm
- 斯坦福的一片文章 综述了迭代最近点算法的各种改进 客观地比较了他们优劣 提出了一个实时的高效组合 做点云配准必读-an artical from Stanforda. summarizes the variant of iterative closest point algorithm and objectively compare the advantages and disadvantages, finily proposed combination with a high-speed r
Iterative-closest-point-algorithm-based-on-genetic
- 基于遗传迭代最近点算法的激光数据配准Iterative closest point algorithm based on genetic data registration of laser-Iterative closest point algorithm based on genetic data registration of laser
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
closestPairPoints
- 使用分治法求大量点中的最近点对.使用MFC做用户界面.10^6个点时间大约为0.1妙-Get the closest pair of points from points clouds by divide and conquer method. UI by MFC. It costs about 0.1 second computing from 1,000,000 points
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))
neardis
- 求最近点示例代码(基于MAPX5，VB6实现) 已知一点求最近点-Find the nearest point sample code (based on MAPX5, VB6 implementation) that are known to find the nearest point
NearestPoint
- 算法分析与设计经典问题，用分治法求最近点对，并与蛮力法做对比-Classical algorithm analysis and design problems with the divide and conquer method for the last point, and compared with the brute force method to do
read
- 应用八叉树编码法划分点云邻域空间为多个指定边长的子立方体，保留每个子立方体中距中心点最近的点，实现从空间整体角度对点云的精简。对三维模型数据进行了精简测试，证明了该算法的有效性和实用性。 -Octree encoding application point cloud into space for the neighborhood more than the specified sub-cube side, keep away from each sub-cube in the center o
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