Point Cloud Library (PCL)  1.12.0
/builddir/build/BUILD/pcl-1.12.0/kdtree/kdtree.doxy
1 /**
2  \addtogroup kdtree Module kdtree
3 
4  \section secKDtreePresentation Overview
5 
6  The <b>pcl_kdtree</b> library provides the kd-tree data-structure, using
7  <a href="http://www.cs.ubc.ca/research/flann/">FLANN</a>,
8  that allows for fast <a href="http://en.wikipedia.org/wiki/Nearest_neighbor_search">nearest neighbor searches</a>.
9 
10  A <a href="http://en.wikipedia.org/wiki/Kd-tree">Kd-tree</a> (<i>k</i>-dimensional tree) is a space-partitioning data
11  structure that stores a set of k-dimensional points in a tree structure that enables efficient range searches and
12  nearest neighbor searches. Nearest neighbor searches are a core operation when working with point cloud data and can
13  be used to find correspondences between groups of points or feature descriptors or to define the local neighborhood
14  around a point or points.
15 
16  \image html http://www.pointclouds.org/assets/images/contents/documentation/kdtree_mug.png
17 
18  \section secKDtreeRequirements Requirements
19  - \ref common "common"
20 
21 */