Package org.openimaj.util.tree

Interface Summary

Interface	Description
ByteKDTree.SplitChooser	Interface for describing how a branch in the KD-Tree should be created
DoubleKDTree.SplitChooser	Interface for describing how a branch in the KD-Tree should be created
FloatKDTree.SplitChooser	Interface for describing how a branch in the KD-Tree should be created
IntKDTree.SplitChooser	Interface for describing how a branch in the KD-Tree should be created
LongKDTree.SplitChooser	Interface for describing how a branch in the KD-Tree should be created
ShortKDTree.SplitChooser	Interface for describing how a branch in the KD-Tree should be created
TreeNode<T>

Class Summary

Class	Description
ByteKDTree	Immutable KD-Tree implementation for byte[] data.
ByteKDTree.ApproximateBBFMedianSplit	Approximate best-bin-first median splitting.
ByteKDTree.BasicMedianSplit	Basic median split.
ByteKDTree.BBFMedianSplit	Best-bin-first median splitting.
ByteKDTree.KDTreeNode	An internal node of the KDTree
ByteKDTree.RandomisedBBFMeanSplit	Randomised best-bin-first splitting strategy: Nodes with less than a set number of items become leafs.
DoubleKDTree	Immutable KD-Tree implementation for double[] data.
DoubleKDTree.ApproximateBBFMedianSplit	Approximate best-bin-first median splitting.
DoubleKDTree.BasicMedianSplit	Basic median split.
DoubleKDTree.BBFMedianSplit	Best-bin-first median splitting.
DoubleKDTree.KDTreeNode	An internal node of the KDTree
DoubleKDTree.RandomisedBBFMeanSplit	Randomised best-bin-first splitting strategy: Nodes with less than a set number of items become leafs.
FloatKDTree	Immutable KD-Tree implementation for float[] data.
FloatKDTree.ApproximateBBFMedianSplit	Approximate best-bin-first median splitting.
FloatKDTree.BasicMedianSplit	Basic median split.
FloatKDTree.BBFMedianSplit	Best-bin-first median splitting.
FloatKDTree.KDTreeNode	An internal node of the KDTree
FloatKDTree.RandomisedBBFMeanSplit	Randomised best-bin-first splitting strategy: Nodes with less than a set number of items become leafs.
IncrementalByteKDTree	Implementation of a simple incremental KDTree for byte[]s.
IncrementalDoubleKDTree	Implementation of a simple incremental KDTree for double[]s.
IncrementalFloatKDTree	Implementation of a simple incremental KDTree for float[]s.
IncrementalIntKDTree	Implementation of a simple incremental KDTree for int[]s.
IncrementalLongKDTree	Implementation of a simple incremental KDTree for long[]s.
IncrementalShortKDTree	Implementation of a simple incremental KDTree for short[]s.
IntKDTree	Immutable KD-Tree implementation for int[] data.
IntKDTree.ApproximateBBFMedianSplit	Approximate best-bin-first median splitting.
IntKDTree.BasicMedianSplit	Basic median split.
IntKDTree.BBFMedianSplit	Best-bin-first median splitting.
IntKDTree.KDTreeNode	An internal node of the KDTree
IntKDTree.RandomisedBBFMeanSplit	Randomised best-bin-first splitting strategy: Nodes with less than a set number of items become leafs.
LongKDTree	Immutable KD-Tree implementation for long[] data.
LongKDTree.ApproximateBBFMedianSplit	Approximate best-bin-first median splitting.
LongKDTree.BasicMedianSplit	Basic median split.
LongKDTree.BBFMedianSplit	Best-bin-first median splitting.
LongKDTree.KDTreeNode	An internal node of the KDTree
LongKDTree.RandomisedBBFMeanSplit	Randomised best-bin-first splitting strategy: Nodes with less than a set number of items become leafs.
ShortKDTree	Immutable KD-Tree implementation for short[] data.
ShortKDTree.ApproximateBBFMedianSplit	Approximate best-bin-first median splitting.
ShortKDTree.BasicMedianSplit	Basic median split.
ShortKDTree.BBFMedianSplit	Best-bin-first median splitting.
ShortKDTree.KDTreeNode	An internal node of the KDTree
ShortKDTree.RandomisedBBFMeanSplit	Randomised best-bin-first splitting strategy: Nodes with less than a set number of items become leafs.
TreeNodeImpl<T>