13 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_TYPEDEF_HPP 14 #define MLPACK_CORE_TREE_RECTANGLE_TREE_TYPEDEF_HPP 41 template<
typename MetricType,
typename StatisticType,
typename MatType>
42 using RTree = RectangleTree<MetricType,
46 RTreeDescentHeuristic,
69 template<
typename MetricType,
typename StatisticType,
typename MatType>
95 template<
typename MetricType,
typename StatisticType,
typename MatType>
100 RTreeDescentHeuristic,
126 template<
typename TreeType>
130 template<
typename MetricType,
typename StatisticType,
typename MatType>
161 template<
typename MetricType,
typename StatisticType,
typename MatType>
190 template<
typename MetricType,
typename StatisticType,
typename MatType>
The RPlusTreeSplit class performs the split process of a node on overflow.
RectangleTree< MetricType, StatisticType, MatType, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation > RTree
An implementation of the R tree that satisfies the TreeType policy API.
This class chooses the best child of a node in a Hilbert R tree when inserting a new point...
The splitting procedure for the Hilbert R tree.
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...
A rectangle type tree tree, such as an R-tree or X-tree.
A Rectangle Tree has new points inserted at the bottom.
When descending a RectangleTree to insert a point, we need to have a way to choose a child node when ...
The MinimalSplitsNumberSweep class finds a partition along which we can split a node according to the...
A Rectangle Tree has new points inserted at the bottom.
The MinimalCoverageSweep class finds a partition along which we can split a node according to the cov...
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...