Covering many or few points with unit disks
From MaRDI portal
Publication:839638
DOI10.1007/s00224-008-9135-9zbMath1187.68716OpenAlexW2934288247MaRDI QIDQ839638
Sariel Har-Peled, Sergio Cabello, Mark T. de Berg
Publication date: 2 September 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-008-9135-9
Related Items (10)
Linear Time Approximation Schemes for Geometric Maximum Coverage ⋮ A PTAS for the cardinality constrained covering with unit balls ⋮ Covering Polygons with Rectangles ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ An improved approximation algorithm for the most points covering problem ⋮ Enclosing weighted points with an almost-unit ball ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ New exact algorithms for planar maximum covering location by ellipses problems ⋮ The most points connected-covering problem with two disks ⋮ Experiments with unit disk cover algorithms for covering massive pointsets
Cites Work
- Covering point sets with two disjoint disks or squares
- On a circle placement problem
- On \(k\)-sets in arrangements of curves and surfaces
- Efficient partition trees
- Exact and approximation algorithms for clustering
- Applications of random sampling in computational geometry. II
- Translating a regular grid over a point set
- Approximations and optimal geometric divide-and-conquer
- On a class of \(O(n^ 2)\) problems in computational geometry
- Improved algorithms for placing undesirable facilities
- On Approximating the Depth and Related Problems
- Approximation schemes for covering and packing problems in image processing and VLSI
- Note—On a Modified One-Center Model
- An Expander-Based Approach to Geometric Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Covering many or few points with unit disks
