搜索资源列表
kdtree
- 用matlab实现的kdtree，kdtree适合用于数据挖掘中用于寻找最近邻。
kdtree matlab代码
- matlab代码实现kdtree的构建与应用
基于kdtree的kmeans聚类算法
- 基于kdtree的kmeans聚类方法。
kdtree(1) 方法代码
- kdtree(1) 方法代码
Kdtree
- 本程序实现了kdtree算法，这是一个经典的算法，可以作为颅面重构的辅助程序-Realized by the kdtree algorithm, which is a classical algorithm can be used as a secondary craniofacial reconstruction program
kdtree
- kd树类的实现。内部提供了三种搜索方法。-kd tree class implementation。
kdtree
- K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
kdtree-0.5.4.tar
- kd tree implementation java
KDTree
- 处理网格数据点的KDTREE数据结构程序，剔除相同的点-Dealing with grid data points KDTREE data structure procedures, remove the same point
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
- this class is an implementation of the kd-tree algorithm
KDTreeTest
- 一个KDtree的程序，包含建树过程和消耗的时间。-A KDtree procedures, including the contribution to the process and time consuming.
KDTree
- KDTree Implementation by John Tsiombikas
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.
siftdemo
- 改程序采用C语言编写SIFT算法，包含完整的从图像高斯金字塔、DOG、空间极值点提取、关键点描述、KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助。-Change the use of C language program SIFT algorithm, contains the complete Gaussian pyramid from the image, DOG, space extremum point extraction, descr ipt
kdtree
- a kctree method programm written in c-a kctree method programm written in cpp
raytracer-sample
- 基于KDTree的CPU光线跟踪例程，可以直接编译运行-KDTree of CPU-based ray-tracing routines can be directly compiled to run
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)