#include "dist.h"
§ ElementType
§ is_kdtree_distance
§ is_vector_space_distance
§ ResultType
§ 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 Manhattan (L_1) distance between two vectors.
This is highly optimised, with loop unrolling, as it is one of the most expensive inner loops.
The documentation for this struct was generated from the following file:
- flann/include/opencv2/flann/dist.h