Document Open Access Logo

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs

Authors Sujoy Bhore , Timothy M. Chan , Zhengcheng Huang , Shakhar Smorodinsky , Csaba D. Tóth

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.17.pdf
  • Filesize: 0.77 MB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Geometric Spanners
  • Geometric Intersection Graphs

Metrics

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

Abstract

We present new results on 2- and 3-hop spanners for geometric intersection graphs. These include improved upper and lower bounds for 2- and 3-hop spanners for many geometric intersection graphs in ℝ^d. For example, we show that the intersection graph of n balls in ℝ^d admits a 2-hop spanner of size O^*(n^{3/2 - 1/(2(2⌊d/2⌋ + 1))}) and the intersection graph of n fat axis-parallel boxes in ℝ^d admits a 2-hop spanner of size O(n log^{d+1}n). 
Furthermore, we show that the intersection graph of general semi-algebraic objects in ℝ^d admits a 3-hop spanner of size O^*(n^{3/2 - 1/(2(2D-1))}), where D is a parameter associated with the description complexity of the objects. For such families (or more specifically, for tetrahedra in ℝ³), we provide a lower bound of Ω(n^{4/3}). For 3-hop and axis-parallel boxes in ℝ^d, we provide the upper bound O(n log ^{d-1}n) and lower bound Ω(n ({log n}/{log log n})^{d-2}).

Cite As Get BibTex

Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, and Csaba D. Tóth. Sparse Bounded Hop-Spanners for Geometric Intersection Graphs. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.17

Author Details

Sujoy Bhore
  • Department of Computer Science and Engineering, Indian Institute of Technology Bombay, India
Timothy M. Chan
  • Siebel School of Computing and Data Science, University of Illinois at Urbana-Champaign, IL, USA
Zhengcheng Huang
  • Siebel School of Computing and Data Science, University of Illinois at Urbana-Champaign, IL, USA
Shakhar Smorodinsky
  • Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel
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

  • Chan, Timothy M.: Work supported in part by NSF Grant CCF-2224271.
  • Smorodinsky, Shakhar: Partially supported by Grant 1065/20 from the Israel Science Foundation, by the United States – Israel Binational Science Foundation (NSF-BSF grant no. 2022792) and by ERC grant no. 882971 "GeoScape" and by the Erdős Center.
  • Tóth, Csaba D.: Research was partially supported by the NSF award DMS-2154347.

References

  1. Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, and Micha Sharir. Intersection queries for flat semi-algebraic objects in three dimensions and related problems. ACM Trans. Algorithms, 2025. Just Accepted. URL: https://doi.org/10.1145/3721290.
  2. Pankaj K. Agarwal and Jirí Matoušek. On range searching with semialgebraic sets. Discret. Comput. Geom., 11:393-418, 1994. URL: https://doi.org/10.1007/BF02574015.
  3. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81-100, 1993. URL: https://doi.org/10.1007/BF02189308.
  4. Boris Aronov, Mark de Berg, Esther Ezra, and Micha Sharir. Improved bounds for the union of locally fat objects in the plane. SIAM J. Comput., 43(2):543-572, 2014. URL: https://doi.org/10.1137/120891241.
  5. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, and Angela Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 45(6):891-923, 1998. URL: https://doi.org/10.1145/293347.293348.
  6. Martin Balko, Adam Sheffer, and Ruiwen Tang. The constant of point-line incidence constructions. Comput. Geom., 114:102009, 2023. URL: https://doi.org/10.1016/J.COMGEO.2023.102009.
  7. Abdul Basit, Artem Chernikov, Sergei Starchenko, Terence Tao, and Chieu-Minh Tran. Zarankiewicz’s problem for semilinear hypergraphs. Forum of Mathematics, Sigma, 9:e59, 2021. URL: https://doi.org/10.1017/fms.2021.52.
  8. Mark de Berg, A. Frank van der Stappen, Jules Vleugels, and Matthew J. Katz. Realistic input models for geometric algorithms. Algorithmica, 34(1):81-97, 2002. URL: https://doi.org/10.1007/S00453-002-0961-X.
  9. Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, and Shakhar Smorodinsky Csaba D. Tóth. Sparse bounded hop-spanners for geometric intersection graphs. CoRR, abs/2504.05861, 2025. URL: https://doi.org/10.48550/arXiv.2504.05861.
  10. Ahmad Biniaz. Plane hop spanners for unit disk graphs: Simpler and better. Comput. Geom., 89:101622, 2020. URL: https://doi.org/10.1016/j.comgeo.2020.101622.
  11. Nicolas Catusse, Victor Chepoi, and Yann Vaxès. Planar hop spanners for unit disk graphs. In Proc. 6th ALGOSENSORS, volume 6451 of LNCS, pages 16-30. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-16988-5_2.
  12. Timothy M. Chan. Approximate nearest neighbor queries revisited. Discret. Comput. Geom., 20(3):359-373, 1998. URL: https://doi.org/10.1007/PL00009390.
  13. Timothy M. Chan. Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms, 46(2):178-189, 2003. URL: https://doi.org/10.1016/S0196-6774(02)00294-8.
  14. Timothy M. Chan. Dynamic subgraph connectivity with geometric applications. SIAM J. Comput., 36(3):681-694, 2006. URL: https://doi.org/10.1137/S009753970343912X.
  15. Timothy M. Chan and Sariel Har-Peled. On the number of incidences when avoiding an induced biclique in geometric settings. In Proc. 34th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1398-1413, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch50.
  16. Timothy M. Chan and Zhengcheng Huang. Constant-hop spanners for more geometric intersection graphs, with even smaller size. In Proc. 39th International Symposium on Computational Geometry (SoCG), volume 258 of LIPIcs, pages 23:1-23:16. Schloss Dagstuhl, 2023. URL: https://doi.org/10.4230/LIPICS.SOCG.2023.23.
  17. Bernard Chazelle. Lower bounds for orthogonal range searching: I. The reporting case. J. ACM, 37(2):200-212, 1990. URL: https://doi.org/10.1145/77600.77614.
  18. Bernard Chazelle. Cuttings. In Dinesh P. Mehta and Sartaj Sahni, editors, Handbook of Data Structures and Applications. Chapman and Hall/CRC, 2004. URL: https://doi.org/10.1201/9781420035179.CH25.
  19. Bernard Chazelle and Emo Welzl. Quasi-optimal range searching in space of finite VC-dimension. Discret. Comput. Geom., 4:467-489, 1989. URL: https://doi.org/10.1007/BF02187743.
  20. 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.
  21. James Davies. Box and segment intersection graphs with large girth and chromatic number. Advances in Combinatorics, 2021. URL: https://doi.org/10.19086/aic.25431.
  22. 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.
  23. Alon Efrat, Matthew J. Katz, Frank Nielsen, and Micha Sharir. Dynamic data structures for fat objects and their applications. Comput. Geom., 15(4):215-227, 2000. URL: https://doi.org/10.1016/S0925-7721(99)00059-0.
  24. György Elekes. Sums versus products in number theory, algebra and Erdős geometry. In Gábor Halász, László Lovász, Miklós Simonovits, and Vera T. Sós, editors, Paul Erdős and his Mathematics II, Bolyai Society Mathematical Studies, pages 241-290. Springer, Berlin, 2001. URL: https://link.springer.com/book/9783540422365.
  25. Paul Erdős. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pages 29-36, Prague, 1964. Publishing House of the Czechoslovak Academy of Sciences. URL: https://old.renyi.hu/~p_erdos/1964-06.pdf.
  26. Paul Erdős. Problems and results in combinatorial geometry. In Discrete Geometry and Convexity, volume 440 of Ann. New York Acad. Sci., pages 1-11. Wiley Online Library, 1985. URL: https://old.renyi.hu/~p_erdos/1985-23.pdf.
  27. Jacob Fox, János Pach, Adam Sheffer, Andrew Suk, and Joshua Zahl. A semi-algebraic version of Zarankiewicz’s problem. J. Euro. Math. Soc., 19(6):1785-1810, 2017. URL: https://doi.org/10.4171/JEMS/705.
  28. Martin Fürer and Shiva Prasad Kasiviswanathan. Spanners for geometric intersection graphs with applications. J. Comput. Geom., 3(1):31-64, 2012. URL: https://doi.org/10.20382/jocg.v3i1a3.
  29. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, and An Zhu. Geometric spanners for routing in mobile networks. IEEE J. Sel. Areas Commun., 23(1):174-185, 2005. URL: https://doi.org/10.1109/JSAC.2004.837364.
  30. Jie Gao and Li Zhang. Well-separated pair decomposition for the unit-disk graph metric and its applications. SIAM J. Comput., 35(1):151-169, 2005. URL: https://doi.org/10.1137/S0097539703436357.
  31. Joachim Gudmundsson, Giri Narasimhan, and Michiel H. M. Smid. Applications of geometric spanner networks. In Encyclopedia of Algorithms, pages 86-90. Springer, 2016. URL: https://doi.org/10.1007/978-1-4939-2864-4_15.
  32. Larry Guth and Nets Hawk Katz. On the Erdős distinct distances problem in the plane. Annals of Mathematics, 181(1):155-190, 2015. URL: https://doi.org/10.4007/annals.2015.181.1.2.
  33. Klara Kedem, Ron Livne, János Pach, and Micha Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discret. Comput. Geom., 1:59-70, 1986. URL: https://doi.org/10.1007/BF02187683.
  34. Vladlen Koltun. Almost tight upper bounds for vertical decompositions in four dimensions. J. ACM, 51(5):699-730, 2004. URL: https://doi.org/10.1145/1017460.1017461.
  35. Xiang-Yang Li. Algorithmic, geometric and graphs issues in wireless networks. Wirel. Commun. Mob. Comput., 3(2):119-140, 2003. URL: https://doi.org/10.1002/WCM.107.
  36. Jirí Matousek and Zuzana Patáková. Multilevel polynomial partitions and simplified range searching. Discret. Comput. Geom., 54(1):22-41, 2015. URL: https://doi.org/10.1007/S00454-015-9701-2.
  37. Jiří Matoušek. Reporting points in halfspaces. Computational Geometry, 2(3):169-186, 1992. URL: https://doi.org/10.1016/0925-7721(92)90006-E.
  38. Joseph S.B. Mitchell and Wolfgang Mulzer. Proximity algorithms. In Handbook of Discrete and Computational Geometry, chapter 32, pages 849-874. Chapman and Hall/CRC, 2017. Google Scholar
  39. Giri Narasimhan and Michiel Smid. Geometric Spanner Networks. Cambridge University Press, 2007. Google Scholar
  40. Rajmohan Rajaraman. Topology control and routing in ad hoc networks: a survey. SIGACT News, 33(2):60-73, 2002. URL: https://doi.org/10.1145/564585.564602.
  41. István Tomon and Dmitriy Zakharov. Turán-type results for intersection graphs of boxes. Combinatorics, Probability and Computing, 30(6):982-987, 2021. URL: https://doi.org/10.1017/S0963548321000171.
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