ACloudViewer  3.9.4
A Modern Library for 3D Data Processing
flann::MinkowskiDistance< T > Struct Template Reference

#include <dist.h>

Public Types

typedef bool is_kdtree_distance
 
typedef T ElementType
 
typedef Accumulator< T >::Type ResultType
 

Public Member Functions

 MinkowskiDistance (int order_)
 
template<typename Iterator1 , typename Iterator2 >
ResultType operator() (Iterator1 a, Iterator2 b, size_t size, ResultType worst_dist=-1) const
 
template<typename U , typename V >
ResultType accum_dist (const U &a, const V &b, int) const
 

Public Attributes

int order
 

Detailed Description

template<class T>
struct flann::MinkowskiDistance< T >

Definition at line 253 of file dist.h.

Member Typedef Documentation

◆ ElementType

template<class T >
typedef T flann::MinkowskiDistance< T >::ElementType

Definition at line 257 of file dist.h.

◆ is_kdtree_distance

template<class T >
typedef bool flann::MinkowskiDistance< T >::is_kdtree_distance

Definition at line 255 of file dist.h.

◆ ResultType

template<class T >
typedef Accumulator<T>::Type flann::MinkowskiDistance< T >::ResultType

Definition at line 258 of file dist.h.

Constructor & Destructor Documentation

◆ MinkowskiDistance()

template<class T >
flann::MinkowskiDistance< T >::MinkowskiDistance ( int  order_)
inline

Definition at line 262 of file dist.h.

Member Function Documentation

◆ accum_dist()

template<class T >
template<typename U , typename V >
ResultType flann::MinkowskiDistance< T >::accum_dist ( const U &  a,
const V &  b,
int   
) const
inline

Partial distance, used by the kd-tree.

Definition at line 307 of file dist.h.

References abs(), and flann::MinkowskiDistance< T >::order.

◆ operator()()

template<class T >
template<typename Iterator1 , typename Iterator2 >
ResultType flann::MinkowskiDistance< T >::operator() ( Iterator1  a,
Iterator2  b,
size_t  size,
ResultType  worst_dist = -1 
) const
inline

Compute the Minkowsky (L_p) distance between two vectors.

This is highly optimised, with loop unrolling, as it is one of the most expensive inner loops.

The computation of squared root at the end is omitted for efficiency.

Definition at line 274 of file dist.h.

References abs(), flann::MinkowskiDistance< T >::order, result, and size.

Member Data Documentation

◆ order

template<class T >
int flann::MinkowskiDistance< T >::order

The documentation for this struct was generated from the following file: