Main MRPT website > C++ reference for MRPT 1.5.6
List of all members | Public Types | Public Member Functions | Public Attributes | Protected Member Functions
mrpt::vision::CFeatureListKDTree< FEAT > Class Template Reference

Detailed Description

template<typename FEAT>
class mrpt::vision::CFeatureListKDTree< FEAT >

Helper class: KD-tree search class for vector<KeyPoint>: Call mark_as_outdated() to force rebuilding the kd-tree after modifying the linked feature list.

Template Parameters
FEATCan be cv::KeyPoint or mrpt::vision::TSimpleFeature

Definition at line 229 of file TSimpleFeature.h.

#include <mrpt/vision/TSimpleFeature.h>

Inheritance diagram for mrpt::vision::CFeatureListKDTree< FEAT >:
Inheritance graph

Public Types

typedef KDTreeCapable
< CFeatureListKDTree< FEAT >
, float,
nanoflann::L2_Simple_Adaptor
< float,CFeatureListKDTree
< FEAT > > > 
self_t
 

Public Member Functions

void mark_as_outdated ()
 
 CFeatureListKDTree (const std::vector< FEAT > &data)
 
const CFeatureListKDTree< FEAT > & derived () const
 CRTP helper method. More...
 
CFeatureListKDTree< FEAT > & derived ()
 CRTP helper method. More...
 
Methods that MUST be implemented by children classes of KDTreeCapable
size_t kdtree_get_point_count () const
 Must return the number of data points. More...
 
float kdtree_get_pt (const size_t idx, int dim) const
 Returns the dim'th component of the idx'th point in the class: More...
 
float kdtree_distance (const float *p1, const size_t idx_p2, size_t size) const
 Returns the distance between the vector "p1[0:size-1]" and the data point with index "idx_p2" stored in the class: More...
 
template<typename BBOX >
bool kdtree_get_bbox (BBOX &bb) const
 
Public utility methods to query the KD-tree
size_t kdTreeClosestPoint2D (float x0, float y0, float &out_x, float &out_y, float &out_dist_sqr) const
 KD Tree-based search for the closest point (only ONE) to some given 2D coordinates. More...
 
size_t kdTreeClosestPoint2D (float x0, float y0, float &out_dist_sqr) const
 
size_t kdTreeClosestPoint2D (const TPoint2D &p0, TPoint2D &pOut, float &outDistSqr) const
 
float kdTreeClosestPoint2DsqrError (float x0, float y0) const
 Like kdTreeClosestPoint2D, but just return the square error from some point to its closest neighbor. More...
 
float kdTreeClosestPoint2DsqrError (const TPoint2D &p0) const
 
void kdTreeTwoClosestPoint2D (float x0, float y0, float &out_x1, float &out_y1, float &out_x2, float &out_y2, float &out_dist_sqr1, float &out_dist_sqr2) const
 KD Tree-based search for the TWO closest point to some given 2D coordinates. More...
 
void kdTreeTwoClosestPoint2D (const TPoint2D &p0, TPoint2D &pOut1, TPoint2D &pOut2, float &outDistSqr1, float &outDistSqr2) const
 
std::vector< size_t > kdTreeNClosestPoint2D (float x0, float y0, size_t knn, std::vector< float > &out_x, std::vector< float > &out_y, std::vector< float > &out_dist_sqr) const
 KD Tree-based search for the N closest point to some given 2D coordinates. More...
 
std::vector< size_t > kdTreeNClosestPoint2D (const TPoint2D &p0, size_t N, std::vector< TPoint2D > &pOut, std::vector< float > &outDistSqr) const
 
void kdTreeNClosestPoint2DIdx (float x0, float y0, size_t knn, std::vector< size_t > &out_idx, std::vector< float > &out_dist_sqr) const
 KD Tree-based search for the N closest point to some given 2D coordinates and returns their indexes. More...
 
void kdTreeNClosestPoint2DIdx (const TPoint2D &p0, size_t N, std::vector< size_t > &outIdx, std::vector< float > &outDistSqr) const
 
size_t kdTreeClosestPoint3D (float x0, float y0, float z0, float &out_x, float &out_y, float &out_z, float &out_dist_sqr) const
 KD Tree-based search for the closest point (only ONE) to some given 3D coordinates. More...
 
size_t kdTreeClosestPoint3D (float x0, float y0, float z0, float &out_dist_sqr) const
 
size_t kdTreeClosestPoint3D (const TPoint3D &p0, TPoint3D &pOut, float &outDistSqr) const
 
void kdTreeNClosestPoint3D (float x0, float y0, float z0, size_t knn, std::vector< float > &out_x, std::vector< float > &out_y, std::vector< float > &out_z, std::vector< float > &out_dist_sqr) const
 KD Tree-based search for the N closest points to some given 3D coordinates. More...
 
void kdTreeNClosestPoint3D (const TPoint3D &p0, size_t N, std::vector< TPoint3D > &pOut, std::vector< float > &outDistSqr) const
 
void kdTreeNClosestPoint3DWithIdx (float x0, float y0, float z0, size_t knn, std::vector< float > &out_x, std::vector< float > &out_y, std::vector< float > &out_z, std::vector< size_t > &out_idx, std::vector< float > &out_dist_sqr) const
 KD Tree-based search for the N closest points to some given 3D coordinates. More...
 
size_t kdTreeRadiusSearch3D (const floatx0, const floaty0, const floatz0, const floatmaxRadiusSqr, std::vector< std::pair< size_t, float > > &out_indices_dist) const
 KD Tree-based search for all the points within a given radius of some 3D point. More...
 
size_t kdTreeRadiusSearch2D (const floatx0, const floaty0, const floatmaxRadiusSqr, std::vector< std::pair< size_t, float > > &out_indices_dist) const
 KD Tree-based search for all the points within a given radius of some 2D point. More...
 
void kdTreeNClosestPoint3DIdx (float x0, float y0, float z0, size_t knn, std::vector< size_t > &out_idx, std::vector< float > &out_dist_sqr) const
 KD Tree-based search for the N closest point to some given 3D coordinates and returns their indexes. More...
 
void kdTreeNClosestPoint3DIdx (const TPoint3D &p0, size_t N, std::vector< size_t > &outIdx, std::vector< float > &outDistSqr) const
 

Public Attributes

const std::vector< FEAT > & m_data
 
TKDTreeSearchParams kdtree_search_params
 Parameters to tune the ANN searches. More...
 

Protected Member Functions

void kdtree_mark_as_outdated () const
 To be called by child classes when KD tree data changes. More...
 

Member Typedef Documentation

typedef KDTreeCapable<CFeatureListKDTree< FEAT > ,float ,nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > > mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::self_t
inherited

Definition at line 71 of file KDTreeCapable.h.

Constructor & Destructor Documentation

template<typename FEAT >
mrpt::vision::CFeatureListKDTree< FEAT >::CFeatureListKDTree ( const std::vector< FEAT > &  data)
inline

Definition at line 235 of file TSimpleFeature.h.

Member Function Documentation

const CFeatureListKDTree< FEAT > & mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::derived ( ) const
inlineinherited

CRTP helper method.

Definition at line 81 of file KDTreeCapable.h.

CFeatureListKDTree< FEAT > & mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::derived ( )
inlineinherited

CRTP helper method.

Definition at line 83 of file KDTreeCapable.h.

template<typename FEAT >
float mrpt::vision::CFeatureListKDTree< FEAT >::kdtree_distance ( const float *  p1,
const size_t  idx_p2,
size_t  size 
) const
inline

Returns the distance between the vector "p1[0:size-1]" and the data point with index "idx_p2" stored in the class:

Definition at line 252 of file TSimpleFeature.h.

References ASSERTDEB_, mrpt::vision::CFeatureListKDTree< FEAT >::m_data, and MRPT_UNUSED_PARAM.

template<typename FEAT >
template<typename BBOX >
bool mrpt::vision::CFeatureListKDTree< FEAT >::kdtree_get_bbox ( BBOX &  bb) const
inline

Definition at line 266 of file TSimpleFeature.h.

References MRPT_UNUSED_PARAM.

template<typename FEAT >
size_t mrpt::vision::CFeatureListKDTree< FEAT >::kdtree_get_point_count ( ) const
inline

Must return the number of data points.

Definition at line 242 of file TSimpleFeature.h.

References mrpt::vision::CFeatureListKDTree< FEAT >::m_data.

template<typename FEAT >
float mrpt::vision::CFeatureListKDTree< FEAT >::kdtree_get_pt ( const size_t  idx,
int  dim 
) const
inline

Returns the dim'th component of the idx'th point in the class:

Definition at line 245 of file TSimpleFeature.h.

References ASSERTDEB_, and mrpt::vision::CFeatureListKDTree< FEAT >::m_data.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdtree_mark_as_outdated ( ) const
inlineprotectedinherited

To be called by child classes when KD tree data changes.

Definition at line 672 of file KDTreeCapable.h.

Referenced by mrpt::vision::CFeatureListKDTree< FEAT >::mark_as_outdated().

size_t mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeClosestPoint2D ( float  x0,
float  y0,
float &  out_x,
float &  out_y,
float &  out_dist_sqr 
) const
inlineinherited

KD Tree-based search for the closest point (only ONE) to some given 2D coordinates.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 3D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
out_xThe X coordinate of the found closest correspondence.
out_yThe Y coordinate of the found closest correspondence.
out_dist_sqrThe square distance between the query and the returned point.
Returns
The index of the closest point in the map array.
See Also
kdTreeClosestPoint3D, kdTreeTwoClosestPoint2D

Definition at line 114 of file KDTreeCapable.h.

size_t mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeClosestPoint2D ( float  x0,
float  y0,
float &  out_dist_sqr 
) const
inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Definition at line 144 of file KDTreeCapable.h.

size_t mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeClosestPoint2D ( const TPoint2D p0,
TPoint2D pOut,
float &  outDistSqr 
) const
inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Definition at line 167 of file KDTreeCapable.h.

float mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeClosestPoint2DsqrError ( float  x0,
float  y0 
) const
inlineinherited

Like kdTreeClosestPoint2D, but just return the square error from some point to its closest neighbor.

Definition at line 177 of file KDTreeCapable.h.

float mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeClosestPoint2DsqrError ( const TPoint2D p0) const
inlineinherited

Definition at line 186 of file KDTreeCapable.h.

size_t mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeClosestPoint3D ( float  x0,
float  y0,
float  z0,
float &  out_x,
float &  out_y,
float &  out_z,
float &  out_dist_sqr 
) const
inlineinherited

KD Tree-based search for the closest point (only ONE) to some given 3D coordinates.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 2D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
z0The Z coordinate of the query.
out_xThe X coordinate of the found closest correspondence.
out_yThe Y coordinate of the found closest correspondence.
out_zThe Z coordinate of the found closest correspondence.
out_dist_sqrThe square distance between the query and the returned point.
Returns
The index of the closest point in the map array.
See Also
kdTreeClosestPoint2D

Definition at line 372 of file KDTreeCapable.h.

size_t mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeClosestPoint3D ( float  x0,
float  y0,
float  z0,
float &  out_dist_sqr 
) const
inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Definition at line 406 of file KDTreeCapable.h.

size_t mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeClosestPoint3D ( const TPoint3D p0,
TPoint3D pOut,
float &  outDistSqr 
) const
inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Definition at line 432 of file KDTreeCapable.h.

std::vector<size_t> mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeNClosestPoint2D ( float  x0,
float  y0,
size_t  knn,
std::vector< float > &  out_x,
std::vector< float > &  out_y,
std::vector< float > &  out_dist_sqr 
) const
inlineinherited

KD Tree-based search for the N closest point to some given 2D coordinates.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 3D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
NThe number of closest points to search.
out_xThe vector containing the X coordinates of the correspondences.
out_yThe vector containing the Y coordinates of the correspondences.
out_dist_sqrThe vector containing the square distance between the query and the returned points.
Returns
The list of indices
See Also
kdTreeClosestPoint2D
kdTreeTwoClosestPoint2D

Definition at line 271 of file KDTreeCapable.h.

std::vector<size_t> mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeNClosestPoint2D ( const TPoint2D p0,
size_t  N,
std::vector< TPoint2D > &  pOut,
std::vector< float > &  outDistSqr 
) const
inlineinherited

Definition at line 304 of file KDTreeCapable.h.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeNClosestPoint2DIdx ( float  x0,
float  y0,
size_t  knn,
std::vector< size_t > &  out_idx,
std::vector< float > &  out_dist_sqr 
) const
inlineinherited

KD Tree-based search for the N closest point to some given 2D coordinates and returns their indexes.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 3D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
NThe number of closest points to search.
out_idxThe indexes of the found closest correspondence.
out_dist_sqrThe square distance between the query and the returned point.
See Also
kdTreeClosestPoint2D

Definition at line 329 of file KDTreeCapable.h.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeNClosestPoint2DIdx ( const TPoint2D p0,
size_t  N,
std::vector< size_t > &  outIdx,
std::vector< float > &  outDistSqr 
) const
inlineinherited

Definition at line 351 of file KDTreeCapable.h.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeNClosestPoint3D ( float  x0,
float  y0,
float  z0,
size_t  knn,
std::vector< float > &  out_x,
std::vector< float > &  out_y,
std::vector< float > &  out_z,
std::vector< float > &  out_dist_sqr 
) const
inlineinherited

KD Tree-based search for the N closest points to some given 3D coordinates.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 2D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
z0The Z coordinate of the query.
NThe number of closest points to search.
out_xThe vector containing the X coordinates of the correspondences.
out_yThe vector containing the Y coordinates of the correspondences.
out_zThe vector containing the Z coordinates of the correspondences.
out_dist_sqrThe vector containing the square distance between the query and the returned points.
See Also
kdTreeNClosestPoint2D

Definition at line 458 of file KDTreeCapable.h.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeNClosestPoint3D ( const TPoint3D p0,
size_t  N,
std::vector< TPoint3D > &  pOut,
std::vector< float > &  outDistSqr 
) const
inlineinherited

Definition at line 551 of file KDTreeCapable.h.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeNClosestPoint3DIdx ( float  x0,
float  y0,
float  z0,
size_t  knn,
std::vector< size_t > &  out_idx,
std::vector< float > &  out_dist_sqr 
) const
inlineinherited

KD Tree-based search for the N closest point to some given 3D coordinates and returns their indexes.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 2D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
z0The Z coordinate of the query.
NThe number of closest points to search.
out_idxThe indexes of the found closest correspondence.
out_dist_sqrThe square distance between the query and the returned point.
See Also
kdTreeClosestPoint2D, kdTreeRadiusSearch3D

Definition at line 640 of file KDTreeCapable.h.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeNClosestPoint3DIdx ( const TPoint3D p0,
size_t  N,
std::vector< size_t > &  outIdx,
std::vector< float > &  outDistSqr 
) const
inlineinherited

Definition at line 664 of file KDTreeCapable.h.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeNClosestPoint3DWithIdx ( float  x0,
float  y0,
float  z0,
size_t  knn,
std::vector< float > &  out_x,
std::vector< float > &  out_y,
std::vector< float > &  out_z,
std::vector< size_t > &  out_idx,
std::vector< float > &  out_dist_sqr 
) const
inlineinherited

KD Tree-based search for the N closest points to some given 3D coordinates.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 2D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
z0The Z coordinate of the query.
NThe number of closest points to search.
out_xThe vector containing the X coordinates of the correspondences.
out_yThe vector containing the Y coordinates of the correspondences.
out_zThe vector containing the Z coordinates of the correspondences.
out_idxThe vector containing the indexes of the correspondences.
out_dist_sqrThe vector containing the square distance between the query and the returned points.
See Also
kdTreeNClosestPoint2D

Definition at line 513 of file KDTreeCapable.h.

size_t mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeRadiusSearch2D ( const float  x0,
const float  y0,
const float  maxRadiusSqr,
std::vector< std::pair< size_t, float > > &  out_indices_dist 
) const
inlineinherited

KD Tree-based search for all the points within a given radius of some 2D point.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 3D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
maxRadiusSqrThe square of the desired search radius.
out_indices_distThe output list, with pairs of indeces/squared distances for the found correspondences.
Returns
Number of found points.
See Also
kdTreeRadiusSearch3D, kdTreeNClosestPoint2DIdx

Definition at line 608 of file KDTreeCapable.h.

size_t mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeRadiusSearch3D ( const float  x0,
const float  y0,
const float  z0,
const float  maxRadiusSqr,
std::vector< std::pair< size_t, float > > &  out_indices_dist 
) const
inlineinherited

KD Tree-based search for all the points within a given radius of some 3D point.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 2D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
z0The Z coordinate of the query.
maxRadiusSqrThe square of the desired search radius.
out_indices_distThe output list, with pairs of indeces/squared distances for the found correspondences.
Returns
Number of found points.
See Also
kdTreeRadiusSearch2D, kdTreeNClosestPoint3DIdx

Definition at line 577 of file KDTreeCapable.h.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeTwoClosestPoint2D ( float  x0,
float  y0,
float &  out_x1,
float &  out_y1,
float &  out_x2,
float &  out_y2,
float &  out_dist_sqr1,
float &  out_dist_sqr2 
) const
inlineinherited

KD Tree-based search for the TWO closest point to some given 2D coordinates.

This method automatically build the "m_kdtree_data" structure when:

  • It is called for the first time
  • The map has changed
  • The KD-tree was build for 3D.
Parameters
x0The X coordinate of the query.
y0The Y coordinate of the query.
out_x1The X coordinate of the first correspondence.
out_y1The Y coordinate of the first correspondence.
out_x2The X coordinate of the second correspondence.
out_y2The Y coordinate of the second correspondence.
out_dist_sqr1The square distance between the query and the first returned point.
out_dist_sqr2The square distance between the query and the second returned point.
See Also
kdTreeClosestPoint2D

Definition at line 207 of file KDTreeCapable.h.

void mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdTreeTwoClosestPoint2D ( const TPoint2D p0,
TPoint2D pOut1,
TPoint2D pOut2,
float &  outDistSqr1,
float &  outDistSqr2 
) const
inlineinherited

Definition at line 244 of file KDTreeCapable.h.

template<typename FEAT >
void mrpt::vision::CFeatureListKDTree< FEAT >::mark_as_outdated ( )
inline

Member Data Documentation

TKDTreeSearchParams mrpt::math::KDTreeCapable< CFeatureListKDTree< FEAT > , float , nanoflann::L2_Simple_Adaptor<float ,CFeatureListKDTree< FEAT > > >::kdtree_search_params
inherited

Parameters to tune the ANN searches.

Definition at line 94 of file KDTreeCapable.h.

template<typename FEAT >
const std::vector<FEAT>& mrpt::vision::CFeatureListKDTree< FEAT >::m_data



Page generated by Doxygen 1.8.6 for MRPT 1.5.6 Git: 4c65e84 Tue Apr 24 08:18:17 2018 +0200 at mar abr 24 08:26:17 CEST 2018