The efficiency of using k-d trees for finding nearest neighbors in discrete space

DOI10.1016/0020-0190(86)90138-9zbMath0627.68052OpenAlexW2080358756MaRDI QIDQ1092665

O. J. Murphy, Stanley M. Selkow

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90138-9

zbMATH Keywords

nearest neighbork-d treemulti-key searching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Neighbours on a grid ⋮ Finding nearest neighbors with Voronoi tessellations

Cites Work

• Multidimensional binary search trees used for associative searching
• An Algorithm for Finding Best Matches in Logarithmic Expected Time

This page was built for publication: The efficiency of using k-d trees for finding nearest neighbors in discrete space