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.
A node is an object that can be stored in a orthant of a branch.