搜索资源列表
kdtree
- kd树类的实现。内部提供了三种搜索方法。-kd tree class implementation。
flann-1.7.1-src
- kd-tree的建立与操作,可以应用于三维重建，三维导航-kd-tree establishment and operation can be applied to three-dimensional reconstruction of three-dimensional navigation
KDTree-SRC
- KD树，用于范围搜索。大家都懂啦，不用多说了-KD tree for range search
knn
- 实现构建k-d树并且实现k-d树上的最邻近查找算法-Build a kd-tree and kd tree nearest neighbor search algorithm
kdtree
- KD树 KDtree的建立到最近领域的搜索，简单易懂-KD tree KDtree establishment to the nearest field of search, easy to understand
KD_Tree
- 基于K维空间索引的点查询算法KD树，本代码实现一般的查询功能-K-dimensional space-based index point KD tree search algorithm, the code search function in general
kdtree11
- 用matlab编写的关于Kd树算法，很实用的-About using matlab Kd tree algorithm, a very practical
KD-tree
- kd树是一种对k维空间中的实例点进行存储以便对其进行快速搜索的树形数据结构-kd tree is a k-dimensional space for instance points to be stored quickly search tree data structure
kdtree
- kd树的c++语言实现，kd树对多维空间的划分起着重要的作用。-kd tree c++ language, kd tree to divide the multidimensional space plays an important role.
kd_buildtree
- 以matlab2014a为实验平台实现KD树算法。可以参考。-protect KD tree in matlab 2014 a.
knn-kdtree
- kd树，分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。K-D树是二进制空间分割树的特殊的情况。-KD tree, the data structure of K dimensional data space. It is mainly used in the search of key data in multidimensional space (such as range search and nearest neighbor search). K
KD-tree
- C++构建简单的KD树并查找K近邻，是一篇文档，内附代码，代码亲测可用(C++ to build a simple KD tree, and find K nearest neighbor, is a document, enclosing code, code pro test available)
kd
- kd树就是用于讲解kd树形结构的，这个需要看代码来说(The KD tree is used to explain the KD tree structure)
kdtree-master
- kd tree implementaion in scala spark
kd-tree
- kd-tree点云索引方法，源码以及应用实例解析(kd-tree point cloud code)
create_kd_tree
- 通过计算方差，确定划分坐标轴，最后，将点云划分到一个个格子中，这样的好处在于可以将噪点和有效点分别存储于不同的格子中，方便进行去噪。(k-d tree create;By calculating the variance, the coordinate axis is determined. Finally, the point cloud is divided into a number of lattices. The advantage is that the noise and the