New Constructions of SSPDs and their Applications
By: Mohammad A. Abam, Sariel Har-Peled
Potential Business Impact:
Helps computers quickly find nearby points.
$\renewcommand{\Re}{\mathbb{R}}$We present a new optimal construction of a semi-separated pair decomposition (i.e., SSPD) for a set of $n$ points in $\Re^d$. In the new construction each point participates in a few pairs, and it extends easily to spaces with low doubling dimension. This is the first optimal construction with these properties. As an application of the new construction, for a fixed $t>1$, we present a new construction of a $t$-spanner with $O(n)$ edges and maximum degree $O(\log^2 n)$ that has a separator of size $O\pth{n^{1-1/d}}$.
Similar Papers
Well-Separated Pairs Decomposition Revisited
Computational Geometry
Makes computer maps shorter and less tangled.
Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces
Computational Geometry
Makes computer maps work better in curved spaces.
A Tight Lower Bound for Doubling Spanners
Computational Geometry
Makes computer networks faster and more efficient.