11 static const double BIG;
12 KDTree(std::vector<Point>& points);
15 int partition(
const int k,
int* index,
int n,
double* arr);
17 double distance(
int idxOfPoint1,
int idxOfPoint2);
std::vector< int > m_vectorOfPointIndexes
std::vector< Point > m_vectorOfPoints
int partition(const int k, int *index, int n, double *arr)
int locate(const Point &p)
KDTree(std::vector< Point > &points)
double * m_arrayOfCoordinates
double distance(int idxOfPoint1, int idxOfPoint2)
std::vector< int > m_vectorOfReversedPointIndexes