Selecting distances in the plane
From MaRDI portal
Publication:2366232
DOI10.1007/BF01187037zbMath0778.68085OpenAlexW1998382219MaRDI QIDQ2366232
Boris Aronov, Subhash Suri, Micha Sharir, Pankaj K. Agarwal
Publication date: 29 June 1993
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01187037
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (15)
Selection in monotone matrices and computing k th nearest neighbors ⋮ Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications ⋮ Efficient piecewise-linear function approximation using the uniform metric ⋮ Algorithms for proximity problems in higher dimensions ⋮ Selecting distances in arrangements of hyperplanes spanned by points. ⋮ On reverse shortest paths in geometric proximity graphs ⋮ Bottleneck matching in the plane ⋮ The 2-center problem in three dimensions ⋮ Diameter, width, closest line pair, and parametric searching ⋮ Simple algorithms for partial point set pattern matching under rigid motion ⋮ ON ENUMERATING AND SELECTING DISTANCES ⋮ Approximate input sensitive algorithms for point pattern matching ⋮ Intersecting disks using two congruent disks ⋮ One-way and round-trip center location problems ⋮ Shortest paths in intersection graphs of unit disks
Cites Work
- Unnamed Item
- Unnamed Item
- On a circle placement problem
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Some techniques for geometric searching with implicit set representations
- Stable unmerging in linear time and constant space
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Finding the median
- Time bounds for selection
- Applications of random sampling in computational geometry. II
- Algorithms for Reporting and Counting Geometric Intersections
- An Efficient Parallel Biconnectivity Algorithm
- Partitioning with two lines in the plane
- Optimal Point Location in a Monotone Subdivision
- Deterministic coin tossing with applications to optimal parallel list ranking
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Parallel Prefix Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Parallel Transitive Closure and Point Location in Planar Structures
- Parallelism in Comparison Problems
- Slowing down sorting networks to obtain faster sorting algorithms
This page was built for publication: Selecting distances in the plane
