#include "dist.h"
§ ElementType
§ is_kdtree_distance
§ is_vector_space_distance
§ ResultType
§ MinkowskiDistance()
§ accum_dist()
template<class T >
template<typename U , typename V >
Partial distance, used by the kd-tree.
§ operator()()
template<class T >
template<typename Iterator1 , typename Iterator2 >
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.
§ order
The documentation for this struct was generated from the following file:
- flann/include/opencv2/flann/dist.h