Fixed-radius near neighbors search algorithms for points and segments
type: Item
instance of: scholarly article
title: Fixed-radius near neighbors search algorithms for points and segments
zbMATH Open document ID: 0703.68096
DOI: 10.1016/0020-0190(90)90056-4
author: Matthew T. Dickerson
author: R. L. Drysdale
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4153913
zbMATH Keywords: computational geometry
zbMATH Keywords: design of algorithms
zbMATH Keywords: analysis of algorithms
MaRDI profile type: Publication
full work available at URL: 0020-0190(90)90056-4
OpenAlex ID: W2091315626
cites work: The complexity of finding fixed-radius near neighbors
cites work: Q3138889
cites work: A sweepline algorithm for Voronoi diagrams
cites work: Plane-sweep algorithms for intersecting geometric figures
cites work: A new linear algorithm for intersecting convex polygons
cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
description: scientific article; zbMATH DE number 4153913