|When descending a RectangleTree to insert a point, we need to have a way to choose a child node when the point isn't enclosed by any of them. More...|
Linear algebra utility functions, generally performed on matrices or vectors.
Trees and tree-building procedures.
Definition of RTreeDescentHeuristic, a class that chooses the best child of a node in an R tree when inserting a new point.
mlpack is free software; you may redistribute it and/or modify it under the terms of the 3-clause BSD license. You should have received a copy of the 3-clause BSD license along with mlpack. If not, see http://www.opensource.org/licenses/BSD-3-Clause for more information.
Definition in file r_tree_descent_heuristic.hpp.