Returns the hyper-cube covered by this node.
Returns the hyper-cube covered by this node.
Called when a leaf has been removed from the node.
Called when a leaf has been removed from the node. The node may need to cleanup after this, e.g. promote an under-full node upwards.
Returns the child for a given orthant index.
Returns the child for a given orthant index.
Assuming that the given leaf
is a child of this node,
removes the child from this node's children.
Assuming that the given leaf
is a child of this node,
removes the child from this node's children. This method
will perform further clean-up such as merging this node
with its parent if it becomes uninteresting as part of the
removal.
Promotes a leaf that exists in Qi-1 to this tree, by inserting it into this node which is its interesting node in Qi.
Promotes a leaf that exists in Qi-1 to this tree, by inserting it into this node which is its interesting node in Qi.
If the result of insertion is a new child node
below this node, this intermediate node will
be connected to Qi by looking for the corresponding
hyper-cube in the given search path that led here
(i.e. that was constructed in findPN
).
This method also sets the parent of the leaf accordingly.
Returns the corresponding interesting
node in Qi+1, or empty
if no such
node exists.
Returns the corresponding interesting
node in Qi+1, or empty
if no such
node exists.
Sets the corresponding interesting node in Qi+1.
Sets the corresponding interesting node in Qi+1.
Queries the orthant index for this (leaf's or node's) hyper-cube
with respect to a given outer hyper-cube iq
.
Queries the orthant index for this (leaf's or node's) hyper-cube
with respect to a given outer hyper-cube iq
.
Computes the greatest interesting hyper-cube within
a given hyper-cube mq
so that this (leaf's or node's)
hyper-cube and the given point will be placed in
separated orthants of this resulting hyper-cube.
Computes the greatest interesting hyper-cube within
a given hyper-cube mq
so that this (leaf's or node's)
hyper-cube and the given point will be placed in
separated orthants of this resulting hyper-cube.
A right tree node implementation provides more specialized child nodes of type
RightChild
. It furthermore defines the node in Qi-1 via theprev
method.