org.openimaj.util.tree

Class ShortKDTree.KDTreeNode

java.lang.Object

org.openimaj.util.tree.ShortKDTree.KDTreeNode

Enclosing class:

ShortKDTree

public static class ShortKDTree.KDTreeNode
extends Object

An internal node of the KDTree

Field Summary

Fields

Modifier and Type	Field and Description
short	discriminant Splitting value
int	discriminantDimension Splitting dimension
int[]	indices The leaf only holds the indices of the original data
ShortKDTree.KDTreeNode	left Node to the left
short[]	maxBounds The maximum bounds of this node
short[]	minBounds The minimum bounds of this node
ShortKDTree.KDTreeNode	right Node to the right

Constructor Summary

Constructors

Constructor and Description
KDTreeNode(short[][] pnts, IntArrayView inds, ShortKDTree.SplitChooser split) Construct a new node with the given data

Method Summary

Modifier and Type	Method and Description
boolean	isContainedBy(short[] lowerExtreme, short[] upperExtreme) Test whether the bounds of this node are fully contained by the hyperrectangle described by the given bounds.
boolean	isDisjointFrom(short[] lowerExtreme, short[] upperExtreme) Test whether the bounds of this node are disjoint from the hyperrectangle described by the given bounds.
boolean	isLeaf() Test to see if this node is a leaf node (i.e.

Methods inherited from class java.lang.Object

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

Field Detail

left

public ShortKDTree.KDTreeNode left

Node to the left

right

public ShortKDTree.KDTreeNode right

Node to the right

discriminant

public short discriminant

Splitting value

discriminantDimension

public int discriminantDimension

Splitting dimension

minBounds

public short[] minBounds

The minimum bounds of this node

maxBounds

public short[] maxBounds

The maximum bounds of this node

indices

public int[] indices

The leaf only holds the indices of the original data

Constructor Detail

KDTreeNode

public KDTreeNode(short[][] pnts,
                  IntArrayView inds,
                  ShortKDTree.SplitChooser split)

Construct a new node with the given data

Parameters:

pnts - the data for the node and its children

inds - a list of indices that point to the relevant parts of the pnts array that should be used

split - the ShortKDTree.SplitChooser to use when constructing the tree

Method Detail

isLeaf

public boolean isLeaf()

Test to see if this node is a leaf node (i.e. indices != null)

Returns:

true if this is a leaf node; false otherwise

isDisjointFrom

public boolean isDisjointFrom(short[] lowerExtreme,
                              short[] upperExtreme)

Test whether the bounds of this node are disjoint from the hyperrectangle described by the given bounds.

Parameters:

lowerExtreme - the lower bounds of the hyperrectangle

upperExtreme - the upper bounds of the hyperrectangle

Returns:

true if disjoint; false otherwise

isContainedBy

public boolean isContainedBy(short[] lowerExtreme,
                             short[] upperExtreme)

Test whether the bounds of this node are fully contained by the hyperrectangle described by the given bounds.

Parameters:

lowerExtreme - the lower bounds of the hyperrectangle

upperExtreme - the upper bounds of the hyperrectangle

Returns:

true if fully contained; false otherwise