Accession Number:

ADA609961

Title:

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

Descriptive Note:

Final rept. Nov 2013-Jun 2014

Corporate Author:

ARMY RESEARCH LAB ABERDEEN PROVING GROUND MD WEAPONS AND MATERIALS RESEARCH DIRECTORATE

Personal Author(s):

Report Date:

2014-09-01

Pagination or Media Count:

28.0

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.

Subject Categories:

  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE