This class chooses the best child of a node in a Hilbert R tree when inserting a new point. More...
Static Public Member Functions  
template < typename TreeType >  
static size_t  ChooseDescentNode (const TreeType *node, const size_t point) 
Evaluate the node using a heuristic. More...  
template < typename TreeType >  
static size_t  ChooseDescentNode (const TreeType *node, const TreeType *insertedNode) 
Evaluate the node using a heuristic. More...  
This class chooses the best child of a node in a Hilbert R tree when inserting a new point.
This is done, in this class, by using the Hilbert value of the point to be inserted.
Definition at line 26 of file hilbert_r_tree_descent_heuristic.hpp.

static 
Evaluate the node using a heuristic.
Returns the number of the node with minimum largest Hilbert value that is greater than the Hilbert value of the point being inserted.
node  The node that is being evaluated. 
point  The number of the point that is being inserted. 

static 
Evaluate the node using a heuristic.
Returns the number of the node with minimum largest Hilbert value that is greater than the largest Hilbert value of the point being inserted.
node  The node that is being evaluated. 
insertedNode  The node that is being inserted. 