|
Related articles:
Binary tree
Binary search tree
Octree
Quadtree
Big O notation
Key terms: k points node tree search median splitting axis log kd nearest algorithm depth balanced select rectangle subtree dimension splitting plane construct current best hyperplane log n coordinate implemented approximate search point nearest neighbor python intersect invariant takes o inserted search tree current node less than leaf node all points hypersphere search rectangle nearest neighbour choose median data structure cycles through big o notation number of points nearest neighbor search dimensional spaces approximate nearest coordinate of the search Search external links cited by footnotes on Wikipedia page Kd-tree: |
|