Experiments with unit disk cover algorithms for covering massive pointsets
From MaRDI portal
Publication:2096372
DOI10.1016/j.comgeo.2022.101925OpenAlexW4292254659WikidataQ114195428 ScholiaQ114195428MaRDI QIDQ2096372
Publication date: 16 November 2022
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.01716
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)
Related Items (3)
UnitDiskCoverAlgorithms ⋮ Covering a set of points with a minimum number of equal disks via simulated annealing ⋮ Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)
Uses Software
Cites Work
- Polynomial time approximation schemes for minimum disk cover problems
- Approximation algorithms for the unit disk cover problem in 2D and 3D
- Covering many or few points with unit disks
- On a circle placement problem
- Optimal packing and covering in the plane are NP-complete
- Covering a set of points in multidimensional space
- Practical and efficient algorithms for the geometric hitting set problem
- Almost optimal set covers in finite VC-dimension
- A note on multicovering with disks
- Approximation schemes for covering and packing problems in image processing and VLSI
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
- Incremental Clustering and Dynamic Information Retrieval
- ON THE DISCRETE UNIT DISK COVER PROBLEM
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
- Optimal Cover of Points by Disks in a Simple Polygon
- Online unit covering in Euclidean space
This page was built for publication: Experiments with unit disk cover algorithms for covering massive pointsets
