Document Open Access Logo

Online Hitting Sets for Disks of Bounded Radii

Authors Minati De , Satyam Singh , Csaba D. Tóth

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2025.50.pdf
  • Filesize: 1.24 MB
  • 16 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Theory of computation → Online algorithms
Keywords
  • Geometric Hitting Set
  • Online Algorithm
  • Homothets
  • Disks

Metrics

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

Abstract

We present algorithms for the online minimum hitting set problem in geometric range spaces: Given a set P of n points in the plane and a sequence of geometric objects that arrive one-by-one, we need to maintain a hitting set at all times. For disks of radii in the interval [1,M], we present an O(log M log n)-competitive algorithm. This result generalizes from disks to positive homothets of any convex body in the plane with scaling factors in the interval [1,M]. As a main technical tool, we reduce the problem to the online hitting set problem for a finite subset of integer points and bottomless rectangles. Specifically, for a given N > 1, we present an O(log N)-competitive algorithm for the variant where P is a subset of an N× N section of the integer lattice, and the geometric objects are bottomless rectangles.

Cite As Get BibTex

Minati De, Satyam Singh, and Csaba D. Tóth. Online Hitting Sets for Disks of Bounded Radii. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 50:1-50:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.50

Author Details

Minati De
  • Dept. of Mathematics, Indian Institute of Technology Delhi, New Delhi, India
Satyam Singh
  • Department of Computer Science, Aalto University, Espoo, Finland
Csaba D. Tóth
  • Department of Mathematics, California State University Northridge, Los Angeles, CA, USA
  • Department of Computer Science, Tufts University, Medford, MA, USA

Funding

  • De, Minati: Research on this paper was supported by SERB MATRICS Grant MTR/2021/ 000584.
  • Singh, Satyam: Research on this paper was supported by the Research Council of Finland, Grant 363444.
  • Tóth, Csaba D.: Research on this paper was supported, in part, by the NSF award DMS-2154347.

References

  1. Shanli Alefkhani, Nima Khodaveisi, and Mathieu Mari. Online hitting set of d-dimensional fat objects. In Proc. 21st International Workshop on Approximation and Online Algorithms (WAOA), volume 14297 of LNCS, pages 134-144. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-49815-2_10.
  2. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, and Joseph Naor. The online set cover problem. SIAM J. Comput., 39(2):361-370, 2009. URL: https://doi.org/10.1137/060661946.
  3. Moses Charikar, Chandra Chekuri, Tomás Feder, and Rajeev Motwani. Incremental clustering and dynamic information retrieval. SIAM J. Comput., 33(6):1417-1440, 2004. URL: https://doi.org/10.1137/S0097539702418498.
  4. Jonathan B. Conroy and Csaba D. Tóth. Hop-spanners for geometric intersection graphs. Journal of Computational Geometry, 14(2):26-64, 2023. URL: https://doi.org/10.20382/jocg.v14i2a3.
  5. Minati De, Saksham Jain, Sarat Varma Kallepalli, and Satyam Singh. Online geometric covering and piercing. Algorithmica, 86:2739-2765, 2024. URL: https://doi.org/10.1007/s00453-024-01244-1.
  6. Minati De, Ratnadip Mandal, and Satyam Singh. New lower bound and algorithm for online geometric hitting set problem. In Computing and Combinatorics - 31st International Computing and Combinatorics Conference, COCOON 2025, Proceedings, Part I, volume 15983 of Lecture Notes in Computer Science, pages 234-247. Springer, 2025. URL: https://doi.org/10.1007/978-981-95-0215-8_18.
  7. Minati De and Satyam Singh. Hitting geometric objects online via points in ℤ^d. In Proc. 28th Conf. Computing and Combinatorics (COCOON), volume 13595 of LNCS, pages 537-548. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-22105-7_48.
  8. Minati De and Satyam Singh. Online hitting of unit balls and hypercubes in ℝ^d using points from ℤ^d. Theor. Comput. Sci., 992:114452, 2024. URL: https://doi.org/10.1016/J.TCS.2024.114452.
  9. Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth. Online unit covering in Euclidean space. Theor. Comput. Sci., 809:218-230, 2020. URL: https://doi.org/10.1016/J.TCS.2019.12.010.
  10. Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth. Sparse hop spanners for unit disk graphs. Comput. Geom., 100:101808, 2022. URL: https://doi.org/10.1016/J.COMGEO.2021.101808.
  11. Adrian Dumitrescu and Csaba D. Tóth. Online unit clustering and unit covering in higher dimensions. Algorithmica, 84(5):1213-1231, 2022. URL: https://doi.org/10.1007/S00453-021-00916-6.
  12. Guy Even and Shakhar Smorodinsky. Hitting sets online and unique-max coloring. Discret. Appl. Math., 178:71-82, 2014. URL: https://doi.org/10.1016/J.DAM.2014.06.019.
  13. Ivor van der Hoog, Vahideh Keikha, Maarten Löffler, Ali Mohades, and Jérôme Urhausen. Maximum-area triangle in a convex polygon, revisited. Inf. Process. Lett., 161:105943, 2020. URL: https://doi.org/10.1016/J.IPL.2020.105943.
  14. Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, and Andreas Wiese. Online and dynamic algorithms for geometric set cover and hitting set. In Proc. 39th Symposium on Computational Geometry (SoCG), volume 258 of LIPIcs, pages 46:1-46:17. Schloss Dagstuhl, 2023. URL: https://doi.org/10.4230/LIPICS.SOCG.2023.46.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact