Fixed-radius near neighbors search algorithms for points and segments
From MaRDI portal
Publication:916423
DOI10.1016/0020-0190(90)90056-4zbMath0703.68096OpenAlexW2091315626MaRDI QIDQ916423
Matthew T. Dickerson, Robert L. Scot Drysdale
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90056-4
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
Algorithms for proximity problems in higher dimensions ⋮ Fixed-radius near neighbors search ⋮ Fast greedy triangulation algorithms. ⋮ Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies ⋮ Multidimensional phase recovery and interpolative decomposition butterfly factorization
Cites Work
- Unnamed Item
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- A sweepline algorithm for Voronoi diagrams
- The complexity of finding fixed-radius near neighbors
- A new linear algorithm for intersecting convex polygons
- Plane-sweep algorithms for intersecting geometric figures
This page was built for publication: Fixed-radius near neighbors search algorithms for points and segments
