public static class IntKDTree.ApproximateBBFMedianSplit extends Object implements IntKDTree.SplitChooser
Constructor and Description |
---|
ApproximateBBFMedianSplit()
Construct with the default maximum number of items per bucket
|
ApproximateBBFMedianSplit(int maxBucketSize)
Construct with the given maximum number of items per bucket
|
Modifier and Type | Method and Description |
---|---|
IntIntPair |
chooseSplit(int[][] pnts,
IntArrayView inds,
int depth,
int[] minBounds,
int[] maxBounds)
Choose the dimension and discriminant on which to split the data.
|
public ApproximateBBFMedianSplit()
public ApproximateBBFMedianSplit(int maxBucketSize)
maxBucketSize
- maximum number of items per bucketpublic IntIntPair chooseSplit(int[][] pnts, IntArrayView inds, int depth, int[] minBounds, int[] maxBounds)
IntKDTree.SplitChooser
chooseSplit
in interface IntKDTree.SplitChooser
pnts
- the raw datainds
- the indices of the data under considerationdepth
- the depth of the current data in the treeminBounds
- the minimum boundsmaxBounds
- the maximum bounds