A note on Euclidean near neighbor searching in the plane

DOI10.1016/0020-0190(79)90117-0MaRDI QIDQ1253102zbMATH OpenOpenAlexWikidataFDO

Authors Jon 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

Computational GeometryEuclidean Near Neighbor SearchingPlane

Mathematics Subject Classification ID

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

Cites work

• A data structure for manipulating priority queues
• Complexity of Combinatorial Algorithms
• Decomposable searching problems I. Static-to-dynamic transformation
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Multidimensional Searching Problems

Cited in

(9)

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

This page was built for publication: A note on Euclidean near neighbor searching in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253102)