org.openimaj.util.tree

Interface ShortKDTree.SplitChooser

All Known Implementing Classes:

ShortKDTree.ApproximateBBFMedianSplit, ShortKDTree.BasicMedianSplit, ShortKDTree.BBFMedianSplit, ShortKDTree.RandomisedBBFMeanSplit

Enclosing class:

ShortKDTree

public static interface ShortKDTree.SplitChooser

Interface for describing how a branch in the KD-Tree should be created

Author:

Jonathon Hare (jsh2@ecs.soton.ac.uk)

Method Summary

Modifier and Type	Method and Description
IntShortPair	chooseSplit(short[][] pnts, IntArrayView inds, int depth, short[] minBounds, short[] maxBounds) Choose the dimension and discriminant on which to split the data.

Method Detail

chooseSplit

IntShortPair chooseSplit(short[][] pnts,
                         IntArrayView inds,
                         int depth,
                         short[] minBounds,
                         short[] maxBounds)

Choose the dimension and discriminant on which to split the data.

Parameters:

pnts - the raw data

inds - the indices of the data under consideration

depth - the depth of the current data in the tree

minBounds - the minimum bounds

maxBounds - the maximum bounds

Returns:

the dimension and discriminant, or null iff this is a leaf (containing all the points in inds).