TY - GEN
T1 - Local Spanners Revisited
AU - Ashur, Stav
AU - Har-Peled, Sariel
N1 - Publisher Copyright:
© Stav Ashur and Sariel Har-Peled; licensed under Creative Commons License CC-BY 4.0.
PY - 2024/6/1
Y1 - 2024/6/1
N2 - For a set P ⊆ R2 of points and a family F of regions, a local t-spanner of P is a sparse graph G over P, such that for any region r ∈ F the subgraph restricted to r, denoted by G ∩ r, is a t-spanner for all the points of r ∩ P. We present algorithms for the construction of local spanners with respect to several families of regions such as homothets of a convex region. Unfortunately, the number of edges in the resulting graph depends logarithmically on the spread of the input point set. We prove that this dependency cannot be removed, thus settling an open problem raised by Abam and Borouny. We also show improved constructions (with no dependency on the spread) of local spanners for fat triangles, and regular k-gons. In particular, this improves over the known construction for axis-parallel squares. We also study notions of weaker local spanners where one is allowed to shrink the region a “bit”. Surprisingly, we show a near linear-size construction of a weak spanner for axis-parallel rectangles, where the shrinkage is multiplicative. Any spanner is a weak local spanner if the shrinking is proportional to the diameter of the region.
AB - For a set P ⊆ R2 of points and a family F of regions, a local t-spanner of P is a sparse graph G over P, such that for any region r ∈ F the subgraph restricted to r, denoted by G ∩ r, is a t-spanner for all the points of r ∩ P. We present algorithms for the construction of local spanners with respect to several families of regions such as homothets of a convex region. Unfortunately, the number of edges in the resulting graph depends logarithmically on the spread of the input point set. We prove that this dependency cannot be removed, thus settling an open problem raised by Abam and Borouny. We also show improved constructions (with no dependency on the spread) of local spanners for fat triangles, and regular k-gons. In particular, this improves over the known construction for axis-parallel squares. We also study notions of weaker local spanners where one is allowed to shrink the region a “bit”. Surprisingly, we show a near linear-size construction of a weak spanner for axis-parallel rectangles, where the shrinkage is multiplicative. Any spanner is a weak local spanner if the shrinking is proportional to the diameter of the region.
KW - Fault-tolerant spanners
KW - Geometric graphs
UR - http://www.scopus.com/inward/record.url?scp=85195415690&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.SWAT.2024.2
DO - 10.4230/LIPIcs.SWAT.2024.2
M3 - Conference contribution
AN - SCOPUS:85195415690
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024
A2 - Bodlaender, Hans L.
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024
Y2 - 12 June 2024 through 14 June 2024
ER -