org.openimaj.util.tree

Interface LongKDTree.SplitChooser

All Known Implementing Classes:

LongKDTree.ApproximateBBFMedianSplit, LongKDTree.BasicMedianSplit, LongKDTree.BBFMedianSplit, LongKDTree.RandomisedBBFMeanSplit

Enclosing class:

LongKDTree

public static interface LongKDTree.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
IntLongPair	chooseSplit(long[][] pnts, IntArrayView inds, int depth, long[] minBounds, long[] maxBounds) Choose the dimension and discriminant on which to split the data.

Method Detail

chooseSplit

IntLongPair chooseSplit(long[][] pnts,
                        IntArrayView inds,
                        int depth,
                        long[] minBounds,
                        long[] 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).