Description: In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a multidimensional search key
- [KD_Tree] - KD_Tree In computer science, a kd-tree (
- [ktree-1] - Min k tree in tabu search
File list (Check if you may need any files):
kdtree.h
kdtree.cpp
testKdTree.cpp
Download