cz.cuni.jagrlib.iface
Class KDTree.IntNode

java.lang.Object
  cz.cuni.jagrlib.iface.KDTree.IntNode

Enclosing interface:

KDTree

public static class KDTree.IntNode
extends java.lang.Object

K-D-tree node for discrete data (Z^K space).

See Also:

KDTree.java

Field Summary

int	cardinality Subtree cardinality (number of stored samples), if applicable.
int[]	data Node data: samples in leaf node or average value (color) in inner node..
int	dim Splitting dimension.
KDTree.IntNode	left Left subtree (lower coordinates).
int[]	lower Lower bounds [x,y,z..].
KDTree.IntNode	median Dividing - median - hyperplane (dim-1).
KDTree.IntNode	right Right subtree (greater coordinates).
int	split Splitting position = lowest coordinate of the right (upper) cell.
int[]	upper Upper bounds [x,y,z..].

Constructor Summary

KDTree.IntNode()

Method Summary

Methods inherited from class java.lang.Object

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

Field Detail

cardinality

public int cardinality

Subtree cardinality (number of stored samples), if applicable.

lower

public int[] lower

Lower bounds [x,y,z..]. Optional in non-root nodes.

upper

public int[] upper

Upper bounds [x,y,z..]. Optional in non-root nodes.

dim

public int dim

Splitting dimension.

split

public int split

Splitting position = lowest coordinate of the right (upper) cell.

data

public int[] data

Node data: samples in leaf node or average value (color) in inner node..

left

public KDTree.IntNode left

Left subtree (lower coordinates).

median

public KDTree.IntNode median

Dividing - median - hyperplane (dim-1).

right

public KDTree.IntNode right

Right subtree (greater coordinates).

Constructor Detail

KDTree.IntNode

public KDTree.IntNode()