, including all inherited members.
| build(const Mat &_points, bool copyAndReorderPoints=false) | cv::KDTree | |
| build(const Mat &_points, const Mat &_labels, bool copyAndReorderPoints=false) | cv::KDTree | |
| dims() const | cv::KDTree | |
| findNearest(const float *vec, int K, int Emax, int *neighborsIdx, Mat *neighbors=0, float *dist=0, int *labels=0) const | cv::KDTree | |
| findNearest(const float *vec, int K, int Emax, vector< int > *neighborsIdx, Mat *neighbors=0, vector< float > *dist=0, vector< int > *labels=0) const | cv::KDTree | |
| findNearest(const vector< float > &vec, int K, int Emax, CV_OUT vector< int > *neighborsIdx, CV_OUT Mat *neighbors=0, CV_OUT vector< float > *dist=0, CV_OUT vector< int > *labels=0) const | cv::KDTree | |
| findOrthoRange(const float *minBounds, const float *maxBounds, vector< int > *neighborsIdx, Mat *neighbors=0, vector< int > *labels=0) const | cv::KDTree | |
| findOrthoRange(const vector< float > &minBounds, const vector< float > &maxBounds, CV_OUT vector< int > *neighborsIdx, CV_OUT Mat *neighbors=0, CV_OUT vector< int > *labels=0) const | cv::KDTree | |
| getPoint(int ptidx, int *label=0) const | cv::KDTree | |
| getPoints(const int *idx, size_t nidx, Mat &pts, vector< int > *labels=0) const | cv::KDTree | |
| getPoints(const vector< int > &idxs, Mat &pts, CV_OUT vector< int > *labels=0) const | cv::KDTree | |
| KDTree() | cv::KDTree | |
| KDTree(const Mat &_points, bool copyAndReorderPoints=false) | cv::KDTree | |
| KDTree(const Mat &_points, const Mat &_labels, bool copyAndReorderPoints=false) | cv::KDTree | |
| labels | cv::KDTree | |
| maxDepth | cv::KDTree | |
| nodes | cv::KDTree | |
| normType | cv::KDTree | |
| points | cv::KDTree | |