![]() |
ACloudViewer
3.9.4
A Modern Library for 3D Data Processing
|
#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 |
| typedef T flann::MinkowskiDistance< T >::ElementType |
| typedef bool flann::MinkowskiDistance< T >::is_kdtree_distance |
| typedef Accumulator<T>::Type flann::MinkowskiDistance< T >::ResultType |
|
inline |
|
inline |
Partial distance, used by the kd-tree.
Definition at line 307 of file dist.h.
References abs(), and flann::MinkowskiDistance< T >::order.
|
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.
| int flann::MinkowskiDistance< T >::order |
Definition at line 260 of file dist.h.
Referenced by flann::MinkowskiDistance< T >::accum_dist(), and flann::MinkowskiDistance< T >::operator()().