An all-round sweep algorithm for 2-dimensional nearest-neighbor problems
type: Item
instance of: scholarly article
title: An all-round sweep algorithm for 2-dimensional nearest-neighbor problems
zbMATH Open document ID: 0758.68057
DOI: 10.1007/BF01178779
author: Klaus Hinrichs
author: Jurg Nievergelt
author: Peter Schorn
published in: Acta Informatica
publication date: 1993-02-22T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 120327
zbMATH Keywords: nearest-neighbor problems
MaRDI profile type: Publication
cites work: A sweepline algorithm for Voronoi diagrams
cites work: Q4003998
cites work: An O(n log n) algorithm for the all-nearest-neighbors problem
full work available at URL: https://doi.org/10.1007/bf01178779
OpenAlex ID: W1975549052
Recommended article: Q3805895
Recommended article: A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
Recommended article: An O(n log n) algorithm for the all-nearest-neighbors problem
Recommended article: A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
Recommended article: A New Plane-Sweep Algorithm for the K-Closest-Pairs Query
Recommended article: A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
Recommended article: A plane-sweep algorithm for finding a closest pair among convex planar objects
Recommended article: An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Recommended article: Q3795223
description: scientific article; zbMATH DE number 120327