On the Line-Separable Unit-Disk Coverage and Related Problems

Authors Gang Liu, Haitao Wang

Thumbnail PDF


  • Filesize: 0.6 MB
  • 14 pages

Document Identifiers

Author Details

Gang Liu
  • Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA
Haitao Wang
  • Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA

Cite AsGet BibTex

Gang Liu and Haitao Wang. On the Line-Separable Unit-Disk Coverage and Related Problems. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 51:1-51:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


Given a set P of n points and a set S of m disks in the plane, the disk coverage problem asks for a smallest subset of disks that together cover all points of P. The problem is NP-hard. In this paper, we consider a line-separable unit-disk version of the problem where all disks have the same radius and their centers are separated from the points of P by a line 𝓁. We present an m^{2/3} n^{2/3} 2^O(log^*(m+n)) + O((n+m)log(n+m)) time algorithm for the problem. This improves the previously best result of O(nm + n log n) time. Our techniques also solve the line-constrained version of the problem, where centers of all disks of S are located on a line 𝓁 while points of P can be anywhere in the plane. Our algorithm runs in O(m√n + (n+m)log(n+m)) time, which improves the previously best result of O(nm log(m+n)) time. In addition, our results lead to an algorithm of n^{10/3} 2^O(log^*n) time for a half-plane coverage problem (given n half-planes and n points, find a smallest subset of half-planes covering all points); this improves the previously best algorithm of O(n⁴log n) time. Further, if all half-planes are lower ones, our algorithm runs in n^{4/3} 2^O(log^*n) time while the previously best algorithm takes O(n²log n) time.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Theory of computation → Design and analysis of algorithms
  • disk coverage
  • line-separable
  • unit-disk
  • line-constrained
  • half-planes


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Pankaj K. Agarwal and Jiangwei Pan. Near-linear algorithms for geometric hitting sets and set covers. Discrete and Computational Geometry, 63:460-482, 2020. Google Scholar
  2. Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, and Kim Whittlesey. Minimum-cost coverage of point sets by disks. In Proceedings of the 22nd Annual Symposium on Computational Geometry (SoCG), pages 449-458, 2006. Google Scholar
  3. Christoph Ambühl, Thomas Erlebach, Matús̆ Mihalák, and Marc Nunkesser. Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In Proceedings of the 9th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), and the 10th International Conference on Randomization and Computation (RANDOM), pages 3-14, 2006. Google Scholar
  4. Vittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, and Panagiotis Kanellopoulos. Geometric clustering to minimize the sum of cluster sizes. In Proceedings of the 13th European Symposium on Algorithms (ESA), pages 460-471, 2005. Google Scholar
  5. Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J.Ian Munro, and Michiel Smid. Faster algorithms for some optimization problems on collinear points. In Proceedings of the 34th International Symposium on Computational Geometry (SoCG), pages 8:1-8:14, 2018. Google Scholar
  6. Norbert Bus, Nabil H. Mustafa, and Saurabh Ray. Practical and efficient algorithms for the geometric hitting set problem. Discrete Applied Mathematics, 240:25-32, 2018. Google Scholar
  7. Paz Carmi, Matthew J. Katz, and Nissan Lev-Tov. Covering points by unit disks of fixed location. In Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pages 644-655, 2007. Google Scholar
  8. Timothy M. Chan and Elyot Grant. Exact algorithms and APX-hardness results for geometric packing and covering problems. Computational Geometry: Theory and Applications, 47:112-124, 2014. Google Scholar
  9. Timothy M. Chan and Qizheng He. Faster approximation algorithms for geometric set cover. In Proceedings of 36th International Symposium on Computational Geometry (SoCG), pages 27:1-27:14, 2020. Google Scholar
  10. Bernard Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete & Computational Geometry, 9(2):145-158, 1993. Google Scholar
  11. Francisco Claude, Gautam K. Das, Reza dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson, and Alejandro Salinger. An improved line-separable algorithm for discrete unit disk cover. Discrete Mathematics, Algorithms and Applications, 2:77-88, 2010. Google Scholar
  12. Gruia Călinescu, Ion I. Măndoiu, Peng-Jun Wan, and Alexander Z. Zelikovsky. Selecting forwarding neighbors in wireless ad hoc networks. Mobile Networks and Applications, 9:101-111, 2004. Google Scholar
  13. Gautam K. Das, Sandip Das, and Subhas C. Nandy. Homogeneous 2-hop broadcast in 2D. Computational Geometry: Theory and Applications, 43:182-190, 2010. Google Scholar
  14. Herbert Edelsbrunner and Ernst P. Mücke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9:66-104, 1990. Google Scholar
  15. Tomás Feder and Daniel H. Greene. Optimal algorithms for approximate clustering. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pages 434-444, 1988. Google Scholar
  16. Shashidhara K. Ganjugunte. Geometric hitting sets and their variants. PhD thesis, Duke University, 2011. Google Scholar
  17. Sariel Har-Peled and Mira Lee. Weighted geometric set cover problems revisited. Journal of Computational Geometry, 3:65-85, 2012. Google Scholar
  18. Nissan Lev-Tov and David Peleg. Polynomial time approximation schemes for base station coverage with minimum total radii. Computer Networks, 47:489-501, 2005. Google Scholar
  19. Jian Li and Yifei Jin. A PTAS for the weighted unit disk cover problem. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP), pages 898-909, 2015. Google Scholar
  20. Nabil H. Mustafa and Saurabh Ray. Improved results on geometric hitting set problems. Discrete and Computational Geometry, 44:883-895, 2010. Google Scholar
  21. Logan Pedersen and Haitao Wang. Algorithms for the line-constrained disk coverage and related problems. Computational Geometry: Theory and Applications, 105-106:101883:1-18, 2022. Google Scholar
  22. Haitao Wang. Unit-disk range searching and applications. In Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pages 32:1-32:17, 2022. Google Scholar