org.openimaj.util.tree

Class IntKDTree.BasicMedianSplit

java.lang.Object

org.openimaj.util.tree.IntKDTree.BasicMedianSplit

All Implemented Interfaces:

IntKDTree.SplitChooser

Enclosing class:

IntKDTree

public static class IntKDTree.BasicMedianSplit
extends Object
implements IntKDTree.SplitChooser

Basic median split. Each dimension will be split at it's median value in turn.

Author:

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

Constructor Summary

Constructors

Constructor and Description
BasicMedianSplit() Construct with the default maximum number of items per bucket
BasicMedianSplit(int maxBucketSize) Construct with the given maximum number of items per bucket

Method Summary

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.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

BasicMedianSplit

public BasicMedianSplit()

Construct with the default maximum number of items per bucket

BasicMedianSplit

public BasicMedianSplit(int maxBucketSize)

Construct with the given maximum number of items per bucket

Parameters:

maxBucketSize - maximum number of items per bucket

Method Detail

chooseSplit

public IntIntPair chooseSplit(int[][] pnts,
                              IntArrayView inds,
                              int depth,
                              int[] minBounds,
                              int[] maxBounds)

Description copied from interface: IntKDTree.SplitChooser

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

Specified by:

chooseSplit in interface IntKDTree.SplitChooser

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).