Papers
Topics
Authors
Recent
Search
2000 character limit reached

Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces

Published 1 Sep 2025 in cs.CG | (2509.01443v1)

Abstract: We consider Steiner spanners in Euclidean and non-Euclidean geometries. In the Euclidean setting, a recent line of work initiated by Le and Solomon [FOCS'19] and further improved by Chang et al. [SoCG'24] obtained Steiner $(1+\varepsilon)$-spanners of size $O_d(\varepsilon{(1-d)/2}\log(1/\varepsilon)n)$, nearly matching the lower bounds of Bhore and T\'oth [SIDMA'22]. We obtain Steiner $(1+\varepsilon)$-spanners of size $O_d(\varepsilon{(1-d)/2}\log(1/\varepsilon)n)$ not only in $d$-dimensional Euclidean space, but also in $d$-dimensional spherical and hyperbolic space. For any fixed dimension $d$, the obtained edge count is optimal up to an $O(\log(1/\varepsilon))$ factor in each of these spaces. Unlike earlier constructions, our Steiner spanners are based on simple quadtrees, and they can be dynamically maintained, leading to efficient data structures for dynamic approximate nearest neighbours and bichromatic closest pair. In the hyperbolic setting, we also show that $2$-spanners in the hyperbolic plane must have $\Omega(n\log n)$ edges, and we obtain a $2$-spanner of size $O_d(n\log n)$ in $d$-dimensional hyperbolic space, matching our lower bound for any constant $d$. Finally, we give a Steiner spanner with additive error $\varepsilon$ in hyperbolic space with $O_d(\varepsilon{(1-d)/2}\log(\alpha(n)/\varepsilon)n)$ edges, where $\alpha(n)$ is the inverse Ackermann function. Our techniques generalize to closed orientable surfaces of constant curvature as well as to some quotient spaces.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.