15 #ifndef __MLPACK_CORE_TREE_RECTANGLE_TREE_R_STAR_TREE_SPLIT_HPP 16 #define __MLPACK_CORE_TREE_RECTANGLE_TREE_R_STAR_TREE_SPLIT_HPP 36 template<
typename TreeType>
37 static void SplitLeafNode(TreeType* tree, std::vector<bool>& relevels);
43 template<
typename TreeType>
67 template<
typename TreeType>
75 #include "r_star_tree_split_impl.hpp" Linear algebra utility functions, generally performed on matrices or vectors.
static void InsertNodeIntoTree(TreeType *destTree, TreeType *srcNode)
Insert a node into another node.
static bool SplitNonLeafNode(TreeType *tree, std::vector< bool > &relevels)
Split a non-leaf node using the "default" algorithm.
static bool StructComp(const SortStruct &s1, const SortStruct &s2)
Comparator for sorting with SortStruct.
Class to allow for faster sorting.
A Rectangle Tree has new points inserted at the bottom.
Include all of the base components required to write MLPACK methods, and the main MLPACK Doxygen docu...
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 metho...