Space partitioning trees in shark used for quick lookup of points in a low-dimensional space. They are no model, but important building blocks, for example for nearest neighbour or clustering algorithms.
Collaboration diagram for Space Partitioning Trees:Classes | |
| class | shark::TreeConstruction |
| Stopping criteria for tree construction. More... | |
| class | shark::BinaryTree< InputT > |
| Super class of binary space-partitioning trees. More... | |
| class | shark::KDTree< InputT > |
| KD-tree, a binary space-partitioning tree. More... | |
| class | shark::KHCTree< Container, CuttingAccuracy > |
| KHC-tree, a binary space-partitioning tree. More... | |
| class | shark::LCTree< VectorType, CuttingAccuracy > |
| LC-tree, a binary space-partitioning tree. More... | |