
TL;DR
This paper investigates local spanners for point sets with respect to various regions, establishing bounds on their size and dependencies, and introduces improved constructions for specific shapes, addressing open problems in the field.
Contribution
It provides algorithms for constructing local spanners for multiple region families, proves the necessity of logarithmic dependency on spread, and offers improved constructions for fat triangles and regular polygons.
Findings
Edge count depends logarithmically on point set spread, and this cannot be avoided.
Improved local spanner constructions for fat triangles and regular k-gons.
Near-linear size weak spanner for axis-parallel rectangles with multiplicative shrinkage.
Abstract
For a set of points , and a family of regions , a of , is a sparse graph over , such that, for any region , the subgraph restricted to , denoted by , is a -spanner for all the points of . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
