mlpack
master
|
A Rectangle Tree has new points inserted at the bottom. More...
Static Public Member Functions | |
template<typename TreeType > | |
static void | SplitLeafNode (TreeType *tree, std::vector< bool > &relevels) |
Split a leaf node using the algorithm described in "The R*-tree: An Efficient and Robust Access method for Points and Rectangles. More... | |
template<typename TreeType > | |
static bool | SplitNonLeafNode (TreeType *tree, std::vector< bool > &relevels) |
Split a non-leaf node using the "default" algorithm. More... | |
Static Private Member Functions | |
template<typename TreeType > | |
static void | InsertNodeIntoTree (TreeType *destTree, TreeType *srcNode) |
Insert a node into another node. More... | |
template<typename ElemType > | |
static bool | PairComp (const std::pair< ElemType, size_t > &p1, const std::pair< ElemType, size_t > &p2) |
Comparator for sorting with std::pair. More... | |
A Rectangle Tree has new points inserted at the bottom.
When these nodes overflow, we split them, moving up the tree and splitting nodes as necessary.
Definition at line 36 of file x_tree_split.hpp.
|
staticprivate |
Insert a node into another node.
|
inlinestaticprivate |
Comparator for sorting with std::pair.
This comparator works a little bit faster then the default comparator.
Definition at line 66 of file x_tree_split.hpp.
|
static |
Split a leaf node using the algorithm described in "The R*-tree: An Efficient and Robust Access method for Points and Rectangles.
" If necessary, this split will propagate upwards through the tree.
|
static |
Split a non-leaf node using the "default" algorithm.
If this is a root node, the tree increases in depth.