When descending a RectangleTree to insert a point, we need to have a way to choose a child node when the point isn't enclosed by any of them. 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) 
When descending a RectangleTree to insert a point, we need to have a way to choose a child node when the point isn't enclosed by any of them.
This heuristic is used to do so using the rules for the R* tree.
Definition at line 26 of file r_star_tree_descent_heuristic.hpp.

static 
Evaluate the node using a heuristic.
The heuristic guarantees two things:
bound  The bound used for the node that is being evaluated. 
point  The index of the point that is being inserted. 

static 