K-d tree: Difference between revisions

Points are values, the code is templated on the the dimensionality of the points and the floating point type of the coordinate. Instead of sorting it uses the faster topN, that partitions the points array in two halves around their median.

<lang d>// Implmentation following pseudocode from

// Carnegie Mellon University, PDF accessed from:

// http://www.autonlab.org/autonweb/14665

immutable int split;

KdNode!(k, F)* left, right;

}