Local Spanners Revisited

01/05/2022
by   Stav Ashur, et al.
0

For a set of points P ⊆ℝ^2, and a family of regions , a local t-spanner of P, is a sparse graph G over P, such that, for any region ∈, the subgraph restricted to , denoted by G = G_P ∩, is a t-spanner for all the points of ∩ 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 can not 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 a somewhat weaker notion of local spanner where one allows to shrink the region a "bit". Any spanner is a weak local spanner if the shrinking is proportional to the diameter. Surprisingly, we show a near linear size construction of a weak spanner for axis-parallel rectangles, where the shrinkage is multiplicative.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2020

Geodesic Spanners for Points in ℝ^3 amid Axis-parallel Boxes

Let P be a set of n points in ℝ^3 amid a bounded number of obstacles. Wh...
research
09/12/2020

Empty axis-parallel boxes

We show that, for every set of n points in the d-dimensional unit cube, ...
research
06/11/2018

Coloring Delaunay-Edges and their Generalizations

We consider geometric graphs whose vertex set is a finite set of points ...
research
12/29/2021

On the Number of Incidences when Avoiding the Klan

Given a set of points P and a set of regions 𝒪, an incidence is a pair (...
research
08/31/2021

ℓ_p-Spread Properties of Sparse Matrices

Random subspaces X of ℝ^n of dimension proportional to n are, with high ...
research
04/21/2022

Lattice and Non-lattice Piercing of Axis-Parallel Rectangles: Exact Algorithms and a Separation Result

For a given family of shapes ℱ in the plane, we study what is the lowest...
research
09/14/2021

Construction of k-matchings and k-regular subgraphs in graph products

A k-matching M of a graph G=(V,E) is a subset M⊆ E such that each connec...

Please sign up or login with your details

Forgot password? Click here to reset