搜索资源列表
kdtree
- kd树的实现，用到matlab-kd tree realization used Matlab
KDTree
- k-d 树的类模板,比较简短.c++代码
kdtree
- kd树类的实现。内部提供了三种搜索方法。-kd tree class implementation。
KDTree
- KDTree Implementation by John Tsiombikas
kdtree
- a kctree method programm written in c-a kctree method programm written in cpp
kdtree
- In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a multidime
moore-tutorial_KDTREES
- kdtree学习指导，介绍kdtree的基本原理、相关基本概念、kdtree的构建方法等。-kdtree tutorial
kdtree-0.5.6.tar
- kdtree的C语言实现，便于用户使用和翻译-kdtree realize
kdtree
- KD tree implementation in C by Rajeev Kumar
avito
- 基于OPENCV的SIFT特征提取与匹配算法。包含完整的从图像高斯金字塔、DOG、空间极值点提取、关键点描述、KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助。-OPENCV based SIFT feature extraction and matching algorithms. Extracted from the image Gaussian pyramid, DOG, space extremum point contains a complet
av
- 基于OPENCV的SIFT特征提取与匹配算法。包含完整的从图像高斯金字塔、DOG、空间极值点提取、关键点描述、KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助。-OPENCV based SIFT feature extraction and matching algorithms. Extracted from the image Gaussian pyramid, DOG, space extremum point contains a complet
new
- KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助-Key step KDtree matching function achieved great help in a comprehensive and in-depth understanding of Lowe' s SIFT algorithm
KDTree-SRC
- KD树，用于范围搜索。大家都懂啦，不用多说了-KD tree for range search
kdtree-master
- K-d tree implementation in C++ for NN and KNN search Templated k-d tree example that makes use of boost geometry point classes. The k-d tree is build in bulk and supports N dimensions. The implementation contains a recursive and iterative ne
kdtree
- kd树，matlab源码 kd树，matlab源码-kdtree wiritten in matlab
kdtree
- KD树 KDtree的建立到最近领域的搜索，简单易懂-KD tree KDtree establishment to the nearest field of search, easy to understand
kdtree
- PCL中KdTree搜索程序，适合初学者了解PCL中KdTree的搜索方法-PCL KdTree search procedure, suitable for beginners to understand the PCLS KdTree search method
kdtree
- kd树的c++语言实现，kd树对多维空间的划分起着重要的作用。-kd tree c++ language, kd tree to divide the multidimensional space plays an important role.
KdTree
- kdtree的建立，实现k近邻搜索，已经按半径搜索-Kdtree establishment, and k nearest neighbor search and radius of the index
kdTree-master
- C ++模板化的KD-Tree实现 这是KD-Tree空间数据结构的仅头部实现。 你只需要提供一个 具有已知编译时间“维度”字段的矢量类型和双重getDimension（size_t维度）方法。 目前支持以下操作： - 从点矢量创建 - 在一个点中心的立方体中查找点 - 从树中删除点（但不是从点的内部列表） - 采用任意函数参数的遍历方法 我已经成功地使用它来删除邻居太近的修剪一组点。(C++ templated KD-Tree implementation T