17 #ifndef __MLPACK_CORE_TREE_RECTANGLE_TREE_X_TREE_SPLIT_HPP
18 #define __MLPACK_CORE_TREE_RECTANGLE_TREE_X_TREE_SPLIT_HPP
46 template<
typename TreeType>
47 static void SplitLeafNode(TreeType* tree, std::vector<bool>& relevels);
53 template<
typename TreeType>
78 template<
typename TreeType>
86 #include "x_tree_split_impl.hpp"
Linear algebra utility functions, generally performed on matrices or vectors.
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...
Class to allow for faster sorting.
static bool structComp(const sortStruct &s1, const sortStruct &s2)
Comparator for sorting with sortStruct.
static void InsertNodeIntoTree(TreeType *destTree, TreeType *srcNode)
Insert a node into another node.
Include all of the base components required to write MLPACK methods, and the main MLPACK Doxygen docu...
A Rectangle Tree has new points inserted at the bottom.
static bool SplitNonLeafNode(TreeType *tree, std::vector< bool > &relevels)
Split a non-leaf node using the "default" algorithm.
const double MAX_OVERLAP
The X-tree paper says that a maximum allowable overlap of 20% works well.