Namespace KDTree

A binary interval heap is double-ended priority queue is a priority queue that it allows for efficient removal of both the maximum and minimum element.

A KD-Tree node which supports a generic number of dimensions. All data items need the same number of dimensions. This node splits based on the largest range of any dimension.

A KDTree class represents the root of a variable-dimension KD-Tree.

A MinHeap is a smallest-first queue based around a binary heap so it is quick to insert / remove items.

A NearestNeighbour iterator for the KD-tree which intelligently iterates and captures relevant data in the search space.

A distance function for our KD-Tree which returns squared euclidean distances.

An interface which enables flexible distance functions.