|
mlpack
2.0.1
|
This is a specialization of the TreeType class to the RectangleTree tree type. More...
Static Public Attributes | |
| static const bool | BinaryTree = false |
| This tree is not necessarily a binary tree. More... | |
| static const bool | FirstPointIsCentroid = false |
| There is no guarantee that the first point in a node is its centroid. More... | |
| static const bool | HasOverlappingChildren = true |
| An R-tree can have overlapping children. More... | |
| static const bool | HasSelfChildren = false |
| Points are not contained at multiple levels of the R-tree. More... | |
| static const bool | RearrangesDataset = false |
| Points are rearranged during building of the tree. More... | |
This is a specialization of the TreeType class to the RectangleTree tree type.
It defines characteristics of the rectangle type trees, and is used to help write tree-independent (but still optimized) tree-based algorithms. See mlpack/core/tree/tree_traits.hpp for more information.
Definition at line 33 of file traits.hpp.
|
static |
This tree is not necessarily a binary tree.
Definition at line 61 of file traits.hpp.
|
static |
There is no guarantee that the first point in a node is its centroid.
Definition at line 44 of file traits.hpp.
|
static |
An R-tree can have overlapping children.
Definition at line 39 of file traits.hpp.
|
static |
Points are not contained at multiple levels of the R-tree.
Definition at line 49 of file traits.hpp.
|
static |
Points are rearranged during building of the tree.
THIS MAY NOT BE TRUE. IT'S HARD TO DYNAMICALLY INSERT POINTS AND REARRANGE THE MATRIX
Definition at line 56 of file traits.hpp.
1.8.11