Description: KD_Tree 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
To Search:
- [quadtree] - quadtree Quadtree the establishment
- [saliency] - A classic papers of the code, " Sali
- [KDTreeTest] - a program used to test kd-tree,was downl
- [kdtree] - In computer science, a kd-tree (short fo
- [ktree-1] - Min k tree in tabu search
File list (Check if you may need any files):
main.cpp
Download