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

Report No. ARL-TN-0629
Authors: Robert J Yager
Date/Pages: September 2014; 28 pages
Abstract: 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.
Distribution: Approved for public release
  Download Report ( 0.870 MBytes )
If you are visually impaired or need a physical copy of this report, please visit and contact DTIC.
 

Last Update / Reviewed: September 1, 2014