搜索资源列表
kdtree
- 用matlab实现的kdtree，kdtree适合用于数据挖掘中用于寻找最近邻。
kdtree matlab代码
- matlab代码实现kdtree的构建与应用
基于kdtree的kmeans聚类算法
- 基于kdtree的kmeans聚类方法。
kdtree(1) 方法代码
- kdtree(1) 方法代码
kdtree
- kd树的实现，用到matlab-kd tree realization used Matlab
OPENCV_SIFT_VC6
- 基于OPENCV的SIFT特征提取与匹配算法。包含完整的从图像高斯金字塔、DOG、空间极值点提取、关键点描述、KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助。程序运行前须安装（1）OpenCV: http://opencvlibrary.sourceforge.net （2）SIFT: http://web.engr.oregonstate.edu/~hess/index.html，并配置其
kdtree
- 用matlab实现的kdtree，kdtree适合用于数据挖掘中用于寻找最近邻。-Using matlab to achieve kdtree, kdtree suitable for data mining used to find the nearest neighbors.
KDTree
- k-d 树的类模板,比较简短.c++代码-kd-tree class template, relatively brief. c++ code
KDTreeTest
- kd-tree c++类模板实现的演示例子. 是从国外网站上下的,结构简单,容易看懂. 文章在: http://www.codeproject.com/KB/architecture/KDTree.aspx-kd-tree c++ realize demonstration class template example. is the site from abroad, from top to bottom, simp
KdTree
- 用Java编写的KD TREE算法实现, 希望对大家有所帮助-Java prepared using KD TREE algorithm, I hope all of you to help
visKDTree
- kdtree. 用于最近点搜索。 可输入点的三维坐标，再输入查询点，即可得到指定的最近点坐标。-kdtree. english for nearest point. Can input three-dimensional coordinates, and then enter a query point can be specified by coordinates of the nearest point.
libkdtree++_0.6.2
- 一个C++写的KdTree容器模板库，支持std容器，和自定义的存储方式，对插入、删除和查找作了优化-A C++ Written KdTree Template Library containers, support std containers, and custom storage by means of an insert, delete, and search was made to optimize
kdtree
- K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
KDTree
- 处理网格数据点的KDTREE数据结构程序，剔除相同的点-Dealing with grid data points KDTREE data structure procedures, remove the same point
KDTree
- KDTree Implementation by John Tsiombikas
Kdtree
- 本程序实现了kdtree算法，这是一个经典的算法，可以作为颅面重构的辅助程序-Realized by the kdtree algorithm, which is a classical algorithm can be used as a secondary craniofacial reconstruction program
KDTree
- kdTree的构建，针对海量点云数据结构的组织-this is file commit to construct a kdtree about large number of cloud points
kdtree
- build kdtree, search knn,
kdtree
- 基于PCL的kdtree，可以根据给定的搜索范围搜索近邻点(you can get the nearest points in the given range by kdtree based on the PCL)