A note on Euclidean near neighbor searching in the plane

DOI10.1016/0020-0190(79)90117-0zbMath0395.68063OpenAlexW2060978628WikidataQ56763501 ScholiaQ56763501MaRDI QIDQ1253102

Jon Louis Bentley, Hermann Maurer

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90117-0

zbMATH Keywords

PlaneComputational GeometryEuclidean Near Neighbor Searching

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Finite geometry and special incidence structures (51E99)

Related Items

Halfspace range search: An algorithmic application of k-sets ⋮ Covering the plane with convex polygons ⋮ Optimal multiple key hashing files for orthogonal range queries ⋮ Reverse shortest path problem in weighted unit-disk graphs ⋮ A space-optimal solution of general region location ⋮ Fast algorithms for computing \(\beta\)-skeletons and their relatives. ⋮ Optimal solutions for a class of point retrieval problems ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions

Cites Work

• Unnamed Item
• Decomposable searching problems I. Static-to-dynamic transformation
• Multidimensional Searching Problems
• A data structure for manipulating priority queues
• Complexity of Combinatorial Algorithms