5 research outputs found
On Locality-Sensitive Orderings and Their Applications
For any constant d and parameter epsilon > 0, we show the existence of (roughly) 1/epsilon^d orderings on the unit cube [0,1)^d, such that any two points p, q in [0,1)^d that are close together under the Euclidean metric are "close together" in one of these linear orderings in the following sense: the only points that could lie between p and q in the ordering are points with Euclidean distance at most epsilon | p - q | from p or q. These orderings are extensions of the Z-order, and they can be efficiently computed.
Functionally, the orderings can be thought of as a replacement to quadtrees and related structures (like well-separated pair decompositions). We use such orderings to obtain surprisingly simple algorithms for a number of basic problems in low-dimensional computational geometry, including (i) dynamic approximate bichromatic closest pair, (ii) dynamic spanners, (iii) dynamic approximate minimum spanning trees, (iv) static and dynamic fault-tolerant spanners, and (v) approximate nearest neighbor search
A Spanner for the Day After
We show how to construct -spanner over a set of
points in that is resilient to a catastrophic failure of nodes.
Specifically, for prescribed parameters , the
computed spanner has edges, where . Furthermore, for any , and
any deleted set of points, the residual graph is -spanner for all the points of except for
of them. No previous constructions, beyond the trivial clique
with edges, were known such that only a tiny additional fraction
(i.e., ) lose their distance preserving connectivity.
Our construction works by first solving the exact problem in one dimension,
and then showing a surprisingly simple and elegant construction in higher
dimensions, that uses the one-dimensional construction in a black box fashion
Light Euclidean Steiner Spanners in the Plane
Lightness is a fundamental parameter for Euclidean spanners; it is the ratio
of the spanner weight to the weight of the minimum spanning tree of a finite
set of points in . In a recent breakthrough, Le and Solomon
(2019) established the precise dependencies on and of the minimum lightness of -spanners, and
observed that additional Steiner points can substantially improve the
lightness. Le and Solomon (2020) constructed Steiner -spanners
of lightness in the plane, where is the \emph{spread} of the point set, defined as the ratio
between the maximum and minimum distance between a pair of points. They also
constructed spanners of lightness in
dimensions . Recently, Bhore and T\'{o}th (2020) established a lower
bound of for the lightness of Steiner
-spanners in , for . The central open
problem in this area is to close the gap between the lower and upper bounds in
all dimensions .
In this work, we show that for every finite set of points in the plane and
every , there exists a Euclidean Steiner
-spanner of lightness ; this matches the
lower bound for . We generalize the notion of shallow light trees, which
may be of independent interest, and use directional spanners and a modified
window partitioning scheme to achieve a tight weight analysis.Comment: 29 pages, 14 figures. A 17-page extended abstract will appear in the
Proceedings of the 37th International Symposium on Computational Geometr