RStarTreeDescentHeuristic Class Reference

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...

Static Public Member Functions
template < typename TreeType >
static size_t	ChooseDescentNode (const TreeType *node, const size_t point)
	Evaluate the node using a heuristic. More...
template < typename TreeType >
static size_t	ChooseDescentNode (const TreeType *node, const TreeType *insertedNode)

Detailed Description

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.

This heuristic is used to do so using the rules for the R* tree.

Definition at line 26 of file r_star_tree_descent_heuristic.hpp.

Member Function Documentation

ChooseDescentNode() [1/2]

static size_t ChooseDescentNode ( const TreeType *  node, const size_t  point  )

static

Evaluate the node using a heuristic.

The heuristic guarantees two things:

1. If point is contained in (or on) bound, the value returned is zero.
2. If the point is not contained in (or on) bound, the value returned is greater than zero.

Parameters

node	The node that is being evaluated.
point	The index of the point that is being inserted.

ChooseDescentNode() [2/2]

static size_t ChooseDescentNode ( const TreeType *  node, const TreeType *  insertedNode  )

static

---

The documentation for this class was generated from the following file:

• /home/ryan/src/mlpack.org/_src/mlpack-git/src/mlpack/core/tree/rectangle_tree/r_star_tree_descent_heuristic.hpp