13#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_TYPEDEF_HPP
14#define MLPACK_CORE_TREE_RECTANGLE_TREE_TYPEDEF_HPP
41template<
typename MetricType,
typename StatisticType,
typename MatType>
69template<
typename MetricType,
typename StatisticType,
typename MatType>
95template<
typename MetricType,
typename StatisticType,
typename MatType>
126template<
typename TreeType>
130template<
typename MetricType,
typename StatisticType,
typename MatType>
161template<
typename MetricType,
typename StatisticType,
typename MatType>
190template<
typename MetricType,
typename StatisticType,
typename MatType>
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 MinimalCoverageSweep class finds a partition along which we can split a node according to the cov...
The MinimalSplitsNumberSweep class finds a partition along which we can split a node according to the...
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...
The RPlusTreeSplit class performs the split process of a node on overflow.
When descending a RectangleTree to insert a point, we need to have a way to choose a child node when ...
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 ...
A Rectangle Tree has new points inserted at the bottom.
A rectangle type tree tree, such as an R-tree or X-tree.
A Rectangle Tree has new points inserted at the bottom.
Linear algebra utility functions, generally performed on matrices or vectors.