搜索资源列表
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.
knnsearch
- 一个小而有效的程序来执行的K -近邻搜索算法，此算法利用JIT 理论加速循环，比向量化有效解决了大量数据的精度问题。甚至比kd-tree效果要佳-A small and effective procedures to implement the K- nearest neighbor search algorithm, this algorithm uses JIT acceleration cycle theory, than to solve a lot of data to quantif
Accelerating_Exact_k_means_Algorithms_with_Geometr
- 一篇介绍加速kd树算法的英文文章，有比较高的参考价值！-A kd tree algorithm to accelerate introduction of English articles, a relatively high reference value!
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!
Nearest_neighbours_and_kD_trees
- 利用kd树寻找多维空间最近点的英文书籍，有利于学习ICP算法！-Multidimensional space using kd tree to find the nearest point of the English books is conducive to learning ICP algorithm!
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.
shuju
- 书中使用主流的程序设计语言C++作为具体的实现语言。 书的内容包括表、栈、队列、树、散列表、优先队列、排序、不相交集算法、图论算法、算法分析 、算法设计、摊还分析、查找树算法、k-d树和配对堆等。 -Book using mainstream programming language C++ as a specific implementation language. The book includes tables, stacks, queues, trees, hash tables
KDTreeprogramVC
- kd树的算法实现,用VC写的，比较详细，大家参考-kd tree program
kd-Tree-On-KNN
- 利用K_D树数据结构实现K邻域搜索的算法代码-K_D tree data structure the K neighborhood search algorithm code
kdTree
- 最近邻算法的构建，构造kd-tree。是统计学习方法中的经典方法。是其源码实现。-Nearest neighbor algorithm, constructed kd-tree. The classical method is a statistical learning method. Its source code to achieve.
kdtree
- KD-Tree的c++实现，并有文档详细介绍了KD-Tree的实现算法。-KD-Tree of c++ implementation, detailing the implementation of the KD-Tree algorithm.
ICPdemo_test
- 迭代最近点（ICP）算法 包括Kd-tree搜索实现-Iterative Closest Point (ICP) algorithm includes Kd-tree search implementation
MyKD_Tree
- KD树算法，能够实现对点云数据进行压缩，非常简单，适用于初学者-KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners
findPointNormals
- 基于kd-tree搜索算法，利用局部邻域的平面拟合，检测三维点云数据的法线方向- Estimates the normals of a sparse set of n 3d points by using a set of the closest neighbours to approximate a plane.
KDTreeTest
- KD tree 实现算法，内有测试例子参考，可以学习里面的内容和思想。(KD tree algorithm.There is a test example of reference, and can learn the contents and ideas inside.)