搜索资源列表
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
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
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.
RTS
- 一个简单即时战略DEMO，具有单选单位、框选单位、A星寻路、自动寻找可走最近点、简单队形等功能-A simple real-time strategy DEMO, with radio units, marquee Unit, A Star pathfinding, automatically looking to go the nearest point, the simple formation
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.
point
- 最近点对问题，采用分治法，编译通过，代码正确-Nearest point problem using the divide-and-conquer method, the compiler through correct code
close_pair
- 算法:求最近点对的实现。在vs2010上运行通过！-Algorithm: Find the nearest point on the realization. In vs2010 run through!
divide1
- 最近点对问题：分治法解决 时间复杂度：O(nlogn)-the closest point problem "divide and conquer" time complexity:O(nlogn)