Fixed-radius near neighbors search algorithms for points and segments
- 28 August 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 35 (5), 269-273
- https://doi.org/10.1016/0020-0190(90)90056-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segmentsDiscrete & Computational Geometry, 1987
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- Voronoi diagrams based on convex distance functionsPublished by Association for Computing Machinery (ACM) ,1985
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- A new linear algorithm for intersecting convex polygonsComputer Graphics and Image Processing, 1982
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- The complexity of finding fixed-radius near neighborsInformation Processing Letters, 1977