15 #ifndef __MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_SPLIT_HPP
16 #define __MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_SPLIT_HPP
35 template<
typename TreeType>
37 std::vector<bool>& relevels);
43 template<
typename TreeType>
45 std::vector<bool>& relevels);
51 template<
typename TreeType>
52 static void GetPointSeeds(
const TreeType& tree,
int& i,
int& j);
57 template<
typename TreeType>
58 static void GetBoundSeeds(
const TreeType& tree,
int& i,
int& j);
63 template<
typename TreeType>
73 template<
typename TreeType>
83 template<
typename TreeType>
91 #include "r_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 void SplitLeafNode(TreeType *tree, std::vector< bool > &relevels)
Split a leaf node using the "default" algorithm.
Include all of the base components required to write MLPACK methods, and the main MLPACK Doxygen docu...
static void GetPointSeeds(const TreeType &tree, int &i, int &j)
Get the seeds for splitting a leaf node.
static void GetBoundSeeds(const TreeType &tree, int &i, int &j)
Get the seeds for splitting a non-leaf node.
static void AssignNodeDestNode(TreeType *oldTree, TreeType *treeOne, TreeType *treeTwo, const int intI, const int intJ)
Assign nodes to the two new nodes.
static void AssignPointDestNode(TreeType *oldTree, TreeType *treeOne, TreeType *treeTwo, const int intI, const int intJ)
Assign points to the two new nodes.
A Rectangle Tree has new points inserted at the bottom.