RStarTreeSplit Class Reference
A Rectangle Tree has new points inserted at the bottom. More...
Static Public Member Functions | |
template < typename TreeType > | |
| static void | PickLeafSplit (TreeType *tree, size_t &bestAxis, size_t &bestIndex) |
| Given a node, return the best dimension and the best index to split on. More... | |
template < typename TreeType > | |
| static size_t | ReinsertPoints (TreeType *tree, std::vector< bool > &relevels) |
| Reinsert any points into the tree, if needed. More... | |
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... | |
Detailed Description
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 26 of file r_star_tree_split.hpp.
Member Function Documentation
◆ PickLeafSplit()
|
static |
Given a node, return the best dimension and the best index to split on.
◆ ReinsertPoints()
|
static |
Reinsert any points into the tree, if needed.
This returns the number of points reinserted.
◆ SplitLeafNode()
|
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.
◆ SplitNonLeafNode()
|
static |
Split a non-leaf node using the "default" algorithm.
If this is a root node, the tree increases in depth.
The documentation for this class was generated from the following file:
- /home/ryan/src/mlpack.org/_src/mlpack-git/src/mlpack/core/tree/rectangle_tree/r_star_tree_split.hpp