搜索资源列表
knnsearch
- 一个小而有效的程序来执行的K -近邻搜索算法，此算法利用JIT 理论加速循环，比向量化有效解决了大量数据的精度问题。甚至比kd-tree效果要佳-A small and effective procedures to implement the K- nearest neighbor search algorithm, this algorithm uses JIT acceleration cycle theory, than to solve a lot of data to quantif
kdtree
- 用matlab编写的k-dtree，加快搜索，在点云拼合中应用广泛。-Matlab prepared with k-dtree, to speed up the search, put together in the point cloud in a wide range of applications.
kdtree
- 有matlab和vc联合编程实现kd树实现过程，附有它们之间转化用的max文件和动态链接库dll文件。-Matlab and vc are the joint programming process to achieve the realization of kd tree, accompanied by their transformation with the max files and dynamic link library dll file.
knnsearch
- 寻找测试样本的最近邻，可以有效的用于用于模式识别，信号处理-This is a small but efficient tool to perform K-nearest neighbor search, which has wide Science and Engineering applications, such as pattern recognition, data mining and signal processing. The code was initially
kdtree1.2
- kd-tree 是广泛用来处理多维寻找最近点的数据结构。该文件中是由matlab调用c++代码实现的，其中实现包括kd-tree的建立最近点的查找等。-kd-tree is kind of data structure which is widely used to find the nearest point in multi-demensions.The zip file contain matlab and cpp files.The functions implemented inclu
kdtree_in_matlab
- kd-tree 是一种常用的数据结构，它在搜索最近点中有普遍用处。该文件是一个用纯matlab写成的源代码。-kd-tree is a commonly used data structure, it is commonly used in searches for the nearest point. The file is a pure source code written in matlab.
BOS_NLTV_v1
- kd树的结构和分析及其源代码的程序使用matlab-kd tree structure and analytical procedures used and its source code matlab
kdtree_3
- here is matlab code for Kd tr-here is matlab code for Kd tree
kdtree1.2
- Kd-trees are data structures which are used to store points in k-dimensional space. As it follows its name, kd-tree is a tree. Tree leafs store points of the dataset (one or several points in each leaf). Each point is stored in one and only one leaf,
findPointNormals
- 基于kd-tree搜索算法，利用局部邻域的平面拟合，检测三维点云数据的法线方向- Estimates the normals of a sparse set of n 3d points by using a set of the closest neighbours to approximate a plane.