A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited

DOI10.1007/3-540-50728-0_62OpenAlexW2100543739MaRDI QIDQ6199482FDOQ6199482

Authors: Klaus Hinrichs, Jurg Nievergelt, Peter Schorn 

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-50728-0_62

Recommendations

• scientific article; zbMATH DE number 4074476
• An all-round sweep algorithm for 2-dimensional nearest-neighbor problems
• A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Probabilistic analysis of an algorithm for solving the \(k\)-dimensional all-nearest-neighbors problem by projection

Mathematics Subject Classification ID

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

This page was built for publication: A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited

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