Public Member Functions
	KDTreeSearch (KDTREE tree, float query_point, int k_closest)

	~KDTreeSearch ()

void	Search (int result_count, float distances, void **results)

Detailed Description

Helper class for searching for the k closest points to query_point in tree.

Definition at line 128 of file kdtree.cpp.

Constructor & Destructor Documentation

◆ KDTreeSearch()

tesseract::KDTreeSearch::KDTreeSearch	(	KDTREE *	tree,
		float *	query_point,
		int	k_closest
	)

Definition at line 147 of file kdtree.cpp.

    : tree_(tree), query_point_(query_point), results_(MAXSEARCH, k_closest) {
  sb_min_ = new float[tree->KeySize];
  sb_max_ = new float[tree->KeySize];
}

◆ ~KDTreeSearch()

tesseract::KDTreeSearch::~KDTreeSearch ( )

Definition at line 153 of file kdtree.cpp.

                            {
  delete[] sb_min_;
  delete[] sb_max_;
}

Member Function Documentation

◆ Search()

void tesseract::KDTreeSearch::Search	(	int *	result_count,
		float *	distances,
		void **	results
	)

Return the k nearest points' data.

Locate the k_closest points to query_point_, and return their distances and data into the given buffers.

Definition at line 160 of file kdtree.cpp.

                                                                             {
  if (tree_->Root.Left == nullptr) {
    *result_count = 0;
  } else {
    for (int i = 0; i < tree_->KeySize; i++) {
      sb_min_[i] = tree_->KeyDesc[i].Min;
      sb_max_[i] = tree_->KeyDesc[i].Max;
    }
    SearchRec(0, tree_->Root.Left);
    int count = results_.elements_count();
    *result_count = count;
    for (int j = 0; j < count; j++) {
      // Pre-cast to float64 as key is a template type and we have no control
      // over its actual type.
      distances[j] = static_cast<float>(sqrt(static_cast<double>(results_.elements()[j].key)));
      results[j] = results_.elements()[j].value;
    }
  }
}

The documentation for this class was generated from the following file: