13 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_SPLIT_HPP
14 #define MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_SPLIT_HPP
33 template<
typename TreeType>
34 static void SplitLeafNode(TreeType *tree,std::vector<bool>& relevels);
40 template<
typename TreeType>
47 template<
typename TreeType>
48 static void GetPointSeeds(
const TreeType *tree,
int& i,
int& j);
53 template<
typename TreeType>
54 static void GetBoundSeeds(
const TreeType *tree,
int& i,
int& j);
59 template<
typename TreeType>
60 static void AssignPointDestNode(TreeType* oldTree,
69 template<
typename TreeType>
70 static void AssignNodeDestNode(TreeType* oldTree,
79 template<
typename TreeType>
80 static void InsertNodeIntoTree(TreeType* destTree, TreeType* srcNode);
87 #include "r_tree_split_impl.hpp"
The core includes that mlpack expects; standard C++ includes and Armadillo.
static void SplitLeafNode(TreeType *tree, std::vector< bool > &relevels)
Split a leaf node using the "default" algorithm.
static bool SplitNonLeafNode(TreeType *tree, std::vector< bool > &relevels)
Split a non-leaf node using the "default" algorithm.
A Rectangle Tree has new points inserted at the bottom.