Multidimensional Binary Search Trees

Martin Rau

30 May 2019

Abstract

This entry provides a formalization of multidimensional binary trees, also known as k-d trees. It includes a balanced build algorithm as well as the nearest neighbor algorithm and the range search algorithm. It is based on the papers Multidimensional binary search trees used for associative searching and An Algorithm for Finding Best Matches in Logarithmic Expected Time.
BSD License

Change history

[2020-15-04] Change representation of k-dimensional points from 'list' to HOL-Analysis.Finite_Cartesian_Product 'vec'. Update proofs to incorporate HOL-Analysis 'dist' and 'cbox' primitives.

Depends On

Topics

Theories

Cite

×
@article{KD_Tree-AFP,
  author  = {Martin Rau},
  title   = {Multidimensional Binary Search Trees},
  journal = {Archive of Formal Proofs},
  month   = May,
  year    = 2019,
  note    = {\url{http://isa-afp.org/entries/KD_Tree.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
Download