Light Euclidean Spanners with Steiner Points

07/22/2020
by   Hung Le, et al.
0

The FOCS'19 paper of Le and Solomon, culminating a long line of research on Euclidean spanners, proves that the lightness (normalized weight) of the greedy (1+ϵ)-spanner in ℝ^d is Õ(ϵ^-d) for any d = O(1) and any ϵ = Ω(n^-1/d-1) (where Õ hides polylogarithmic factors of 1/ϵ), and also shows the existence of point sets in ℝ^d for which any (1+ϵ)-spanner must have lightness Ω(ϵ^-d). Given this tight bound on the lightness, a natural arising question is whether a better lightness bound can be achieved using Steiner points. Our first result is a construction of Steiner spanners in ℝ^2 with lightness O(ϵ^-1logΔ), where Δ is the spread of the point set. In the regime of Δ≪ 2^1/ϵ, this provides an improvement over the lightness bound of Le and Solomon [FOCS 2019]; this regime of parameters is of practical interest, as point sets arising in real-life applications (e.g., for various random distributions) have polynomially bounded spread, while in spanner applications ϵ often controls the precision, and it sometimes needs to be much smaller than O(1/log n). Moreover, for spread polynomially bounded in 1/ϵ, this upper bound provides a quadratic improvement over the non-Steiner bound of Le and Solomon [FOCS 2019], We then demonstrate that such a light spanner can be constructed in O_ϵ(n) time for polynomially bounded spread, where O_ϵ hides a factor of poly(1/ϵ). Finally, we extend the construction to higher dimensions, proving a lightness upper bound of Õ(ϵ^-(d+1)/2 + ϵ^-2logΔ) for any 3≤ d = O(1) and any ϵ = Ω(n^-1/d-1).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2021

Non-homotopic Loops with a Bounded Number of Pairwise Intersections

Let V_n be a set of n points in the plane and let x ∉ V_n. An x-loop is ...
research
12/03/2020

Light Euclidean Steiner Spanners in the Plane

Lightness is a fundamental parameter for Euclidean spanners; it is the r...
research
04/26/2019

Truly Optimal Euclidean Spanners

Euclidean spanners are important geometric structures, having found nume...
research
06/29/2022

Minimum Weight Euclidean (1+ε)-Spanners

Given a set S of n points in the plane and a parameter ε>0, a Euclidean ...
research
06/24/2020

Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays

We consider the problem of digitalizing Euclidean segments. Specifically...
research
02/21/2023

Dynamic Euclidean Bottleneck Matching

A fundamental question in computational geometry is for a set of input p...
research
08/19/2013

A balanced k-means algorithm for weighted point sets

The classical k-means algorithm for partitioning n points in R^d into k ...

Please sign up or login with your details

Forgot password? Click here to reset