13 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_HILBERT_R_TREE_DESCENT_HEURISTIC_HPP
14 #define MLPACK_CORE_TREE_RECTANGLE_TREE_HILBERT_R_TREE_DESCENT_HEURISTIC_HPP
37 template<
typename TreeType>
48 template<
typename TreeType>
50 const TreeType* insertedNode);
56 #include "hilbert_r_tree_descent_heuristic_impl.hpp"
58 #endif // MLPACK_CORE_TREE_RECTANGLE_TREE_HILBERT_R_TREE_DESCENT_HEURISTIC_HPP
The core includes that mlpack expects; standard C++ includes and Armadillo.
This class chooses the best child of a node in a Hilbert R tree when inserting a new point...
static size_t ChooseDescentNode(const TreeType *node, const size_t point)
Evaluate the node using a heuristic.