Finding nearest neighbors with Voronoi tessellations

DOI10.1016/0020-0190(90)90227-OzbMath0695.68043OpenAlexW2015376429MaRDI QIDQ910225

O. J. Murphy, Stanley M. Selkow

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90227-o

zbMATH Keywords

data structuresaverage-case analysisnearest neighborsmulti-key searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Voronoi diagrams and arrangements
• The efficiency of using k-d trees for finding nearest neighbors in discrete space
• Optimal Expected-Time Algorithms for Closest Point Problems
• An Algorithm for Finding Best Matches in Logarithmic Expected Time

This page was built for publication: Finding nearest neighbors with Voronoi tessellations