Creating, Searching, and Deleting KD Trees Using C++.

摘要

K-dimensional (KD) trees use binary space-partitioning algorithms to organize and store data points in K-dimensional space. They are particularly useful for efficient nearest-neighbor search algorithms. This report presents a set of functions, written in C++, that is designed to be used to create, search, and delete KD trees. All of the functions are based on recursive algorithms. Tests for measuring function performance are included, as are examples for creating Voronoi diagrams.