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

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 2014
Accession Number
ADA609961

Entities

People

  • Robert J. Yager

Organizations

  • United States Army Research Laboratory

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Department Of Defense
  • Fungi
  • Information Operations
  • Instructions
  • Iterations
  • Mathematics
  • Measurement
  • Military Research
  • Random Walk
  • Standards
  • Template Patterns

Fields of Study

  • Computer science

Readers

  • Computer Vision.
  • Graph Algorithms and Convex Optimization.
  • Instructional Design and Training Evaluation.

Technology Areas

  • Space
  • Space - Space Objects