An all-round sweep algorithm for 2-dimensional nearest-neighbor problems

DOI10.1007/BF01178779zbMath0758.68057OpenAlexW1975549052MaRDI QIDQ1203723

Klaus Hinrichs, Jurg Nievergelt, Peter Schorn

Publication date: 22 February 1993

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01178779

zbMATH Keywords

nearest-neighbor problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Expected time analysis for Delaunay point location ⋮ A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects ⋮ A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs

Cites Work

• A sweepline algorithm for Voronoi diagrams
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Unnamed Item

This page was built for publication: An all-round sweep algorithm for 2-dimensional nearest-neighbor problems