mlpack
2.0.1
|
A Rectangle Tree has new points inserted at the bottom. More...
Classes | |
struct | SortStruct |
Class to allow for faster sorting. 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... | |
static bool | StructComp (const SortStruct &s1, const SortStruct &s2) |
Comparator for sorting with SortStruct. 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 28 of file r_star_tree_split.hpp.
|
staticprivate |
Insert a node into another node.
|
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.
|
inlinestaticprivate |
Comparator for sorting with SortStruct.
Definition at line 59 of file r_star_tree_split.hpp.
References mlpack::tree::RStarTreeSplit::SortStruct::d.