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.
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 hyper-cube covered by this node.
Returns the hyper-cube covered by this node.
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.