Class KDTree::KDTreeInternal

Nested Relationships

This class is a nested type of Template Class KDTree.

Class Documentation

class KDTreeInternal

Public Functions

virtual void nnInternal(const QueryPoint &point, DistPoint &neighbor) const = 0

Internal recursive version of nnSearch. Provided by subclasses.

Parameters:

  • point – The query Point to search around

  • neighbor – The current nearest neighbor or nullptr if none is found

  • worstDistSq – The remaining search radius for new Neighbors (squared)

virtual void knnInternal(const QueryPoint &point, size_t k, Queue &neighbors, double &worstDistSq) const = 0

Internal recursive version of knnSearch. Provided by subclasses.

Parameters:

  • point – The query Point to search around

  • neighbors – The Queue to place the Neighbors into

  • worstDistSq – The remaining search radius for new Neighbors (squared)

  • k – The number of Neighbors to find

virtual ~KDTreeInternal() = default