搜索资源列表
kmlocal-1.7.1.tar
- 高效的k-means算法实现，使用了k-d树与局部搜索等提高k-means算法的执行效率，同时包含示例代码，用c++代码实现。 Effecient implementation of k-means algorith, k-d tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are imple
NIPS2005_0433
- k-d tree 算法介绍，介绍了一种可行的方法，从而实现搜素。
k-d tree C++ source codes
- 空间数据库中空间数据结构的应用，K-d树基本操作的源码，都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.
A_tutorial_on_kd_trees
- 一篇介绍k-d tree的入门文章，对图像对准方面的研究人员是很好的参考！-An introductory article describes kd tree for image alignment of researchers is a good reference!
c++实现的KNN库:建立高维度的K-d tree
- c++实现的KNN库:建立高维度的K-d tree,实现K邻域搜索，最小半径搜索-K-NN algorithm implementation. It supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions.
kdtree
- K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
KD_Tree
- KD_Tree 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 m
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.
libkdtree_0.7.0
- 一个KD-tree的类STL模板库，版本为0.7.0-libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree.
huffman_coding
- ) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code t
kd_tree
- 一个高效的k-d tree实现，可以广泛的应用与图形图像处理。-K nearest neighbor search based on KD-tree
K-degree-constrained-minimum-spanning-tree
- 本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
K-Smallest_Spanning_Trees
- Perharp the smallest spanning tree is trivial, but just take a look with new problem : K Smallest Spanning Tr-Perharp the smallest spanning tree is trivial, but just take a look with new problem : K Smallest Spanning Tree
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
kdtree
- kd 近邻查找. 一般用在图像拼接等领域-k-d tree to find the nearest one
k-d-tree-CPP-source-codes
- k-d tree C++ source codes
k_d-tree-
- k-d tree的matlab与VC混合实现，可直接使用-using matlab and VC mix programming to realize kd tree.can be used used directly
kd-tree
- K-D树的应用文档，适合对K-D树深入学习的同学。文献对K-D树现状和应用有一定的描述-K- D tree application document, suitable for students to K- D tree in-depth study. Literature on K- D describes the present situation and application of a certain tree
K d tree in matlab
- k d clustering in matlab
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