搜索资源列表
simkd
- kd树的最快实现算法，经过了数次优化后，即使处理数十万个点，也仅仅需要几秒钟，内含使用说明。-kd tree algorithm to achieve the fastest, after a number of optimization, even hundreds of thousands of points. I only need a few seconds, intron use.
Kd-tree
- KD 树代码，常见的数据搜索算法，比较实用-KD tree code, common data search algorithms, more practical
KdTree
- 用Java编写的KD TREE算法实现, 希望对大家有所帮助
icpCpp
- 应用KD-tree和对应点迭代算法对齐两个三维点集
simkd
- kd树的最快实现算法，经过了数次优化后，即使处理数十万个点，也仅仅需要几秒钟，内含使用说明。-kd tree algorithm to achieve the fastest, after a number of optimization, even hundreds of thousands of points. I only need a few seconds, intron use.
Kd-tree
- KD 树代码，常见的数据搜索算法，比较实用-KD tree code, common data search algorithms, more practical
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
KdTree
- 用Java编写的KD TREE算法实现, 希望对大家有所帮助-Java prepared using KD TREE algorithm, I hope all of you to help
icpCpp
- 应用KD-tree和对应点迭代算法对齐两个三维点集-Application of KD-tree and the corresponding two-point iterative algorithm of three-dimensional point set alignment
NIPS2005_0433
- k-d tree 算法介绍，介绍了一种可行的方法，从而实现搜素。-kd tree algorithm, the introduction of a feasible way to achieve the Su-found.
sift-1.1.1_20071108_win
- Rob Hess的SIFT算法的C语言实现(基于OpenCV),金字塔采样和高斯差分提取特征点，K-D树寻找同名点，RANSAC去粗差-Rob Hess of the SIFT algorithm C language (based on OpenCV), sampling and Gaussian pyramid differential extraction of feature points, KD tree search for
kdtree
- K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
kd-trees
- 数据结构的选择与算法效率——从IOI98试题PICTURE谈起 高级数据结构：线段树-The choice of data structure and algorithm efficiency- from IOI98 questions about high-level data structure PICTURE: segment tree
An_intoductory_tutorial_on_kd_trees
- 一篇介绍kd-tree算法的比较实用的英文文章，内容详细，有利于初学者使用！-Kd-tree algorithm is a descr iption of the more practical English articles, detailed help beginners to use!
kdtree_in_matlab
- kd-tree 是一种常用的数据结构，它在搜索最近点中有普遍用处。该文件是一个用纯matlab写成的源代码。-kd-tree is a commonly used data structure, it is commonly used in searches for the nearest point. The file is a pure source code written in matlab.
10.1.1.10.818
- 关于数据库多维索引结构KD树的介绍，包括构建和检索的算法。-Multi-dimensional database index structure on the introduction of KD tree, including the construction and retrieval algorithms
SIFT_area_match
- SIFT算法的区域匹配，比原有的SIFT+KD树匹配更加高效、准确。-different area SIFT algorithm which is better than the original SIFT and KD tree match.
ImageStitch
- 基于SIFT算法的图像拼接 主要是运用SIFT算法求得特征点，然后用kd_tree进行特征点匹配，根据匹配点求得2x2的变换矩阵，然后利用变换矩阵变换图像（需要插值）。-Image Stitch Based on SIFT
kd-Tree-On-KNN
- 利用K_D树数据结构实现K邻域搜索的算法代码-K_D tree data structure the K neighborhood search algorithm code
kd-tree.cpp
- 三维点云配准kd-tree搜索算法，用于特征点的搜索匹配-3 d point cloud registration kd- tree search algorithm, is used to search of feature point matching