A Rectangle Tree has new points inserted at the bottom. More...

Static Public Member Functions

template
<
typename
TreeType
>
static void SplitLeafNode (TreeType *tree, std::vector< bool > &relevels)
 Split a leaf node using the "default" algorithm. More...

 
template
<
typename
TreeType
>
static bool SplitNonLeafNode (TreeType *tree, std::vector< bool > &relevels)
 Split a non-leaf node using the "default" algorithm. More...

 

Detailed Description

A Rectangle Tree has new points inserted at the bottom.

When these nodes overflow, we split them, moving up the tree and splitting nodes as necessary.

Definition at line 26 of file r_tree_split.hpp.

Member Function Documentation

◆ SplitLeafNode()

static void SplitLeafNode ( TreeType *  tree,
std::vector< bool > &  relevels 
)
static

Split a leaf node using the "default" algorithm.

If necessary, this split will propagate upwards through the tree.

◆ SplitNonLeafNode()

static bool SplitNonLeafNode ( TreeType *  tree,
std::vector< bool > &  relevels 
)
static

Split a non-leaf node using the "default" algorithm.

If this is a root node, the tree increases in depth.


The documentation for this class was generated from the following file:
  • /home/jenkins-mlpack/mlpack.org/_src/mlpack-3.3.1/src/mlpack/core/tree/rectangle_tree/r_tree_split.hpp