View source for k-d Tree Data Structure

A [[k-d Tree Data Structure]] is a [[tree-based data structure]] for organizing [[Point (geometry)|point]]s in a <i>k</i>-dimensional [[Euclidean space|space]].
* <B>AKA:</B> [[k-d Tree Data Structure|k-dimensional Tree]], [[k-d Tree Data Structure|Multidimensional Binary Search Tree]].
* <B>Context:</B>
** It can be defined as a [[binary tree]] where every node is a <i>k</i>-dimensional [[Point (geometry)|point]].
** It can (typically) be a [[Space Partitioning]] [[Data Structure]] 
* <B>Example(s):</B>
** <code>[https://docs.scipy.org/doc/scipy-0.15.1/reference/generated/scipy.spatial.KDTree.html scipy.spatial.KDTree]</code>
** an [[Adaptive k-d Tree]].
** ...
** …
* <B>Counter-Example(s):</B>
** [[Octree]],
** [[Quadtree]],
** [[Regression Tree]].
* <B>See:</B> [[Tree Data Structure]], [[Euclidean Space]], [[Nearest Neighbor Search]], [[Binary Space Partitioning]], [[KD-Tree Clustering Algorithm]].

----
----