13 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_STAR_TREE_SPLIT_HPP 14 #define MLPACK_CORE_TREE_RECTANGLE_TREE_R_STAR_TREE_SPLIT_HPP 34 template <
typename TreeType>
35 static void SplitLeafNode(TreeType *tree, std::vector<bool>& relevels);
41 template <
typename TreeType>
48 template<
typename TreeType>
49 static size_t ReinsertPoints(TreeType* tree, std::vector<bool>& relevels);
54 template<
typename TreeType>
64 template <
typename TreeType>
65 static void InsertNodeIntoTree(TreeType* destTree, TreeType* srcNode);
71 template<
typename ElemType,
typename TreeType>
72 static bool PairComp(
const std::pair<ElemType, TreeType>& p1,
73 const std::pair<ElemType, TreeType>& p2)
75 return p1.first < p2.first;
83 #include "r_star_tree_split_impl.hpp" Linear algebra utility functions, generally performed on matrices or vectors.
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.
The core includes that mlpack expects; standard C++ includes and Armadillo.
static bool SplitNonLeafNode(TreeType *tree, std::vector< bool > &relevels)
Split a non-leaf node using the "default" algorithm.
static size_t ReinsertPoints(TreeType *tree, std::vector< bool > &relevels)
Reinsert any points into the tree, if needed.
A Rectangle Tree has new points inserted at the bottom.
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...