AbstractWe present a new optimal construction of a semi-separated pair decomposition (i.e., SSPD) for a set of n points in Rd. 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(log2n) that has a separator of size O(n1−1/d)
Let $(V,delta)$ be a finite metric space, where $V$ is a set of $n$ points and $delta$ is a distance...
The greedy t-spanner of a set of points in the plane is an undirected graph constructed by consideri...
Let $S$ be a set of $n$ points in $\IR^d$ and let $t>1$ be a real number. A $t$-spanner for $S$ is a...
We present a new optimal construction of a semi-separated pair decomposition (i.e., SSPD) for a set ...
A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set is a set {(A i ,B i )} of...
ABSTRACT The well-separated pair decomposition (WSPD) is a fundamental structure in computational ge...
We present an external-memory algorithm to compute a well-separated pair decomposition (WSPD) of a g...
We extend the classic notion of well-separated pair decomposition [P. B. Callahan and S. R. Kosaraju...
Abstract Given a point set in a fixed dimension, we note that a well-separated pair decomposition ca...
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk g...
AbstractLet S be a set of n points in Rd and lett>1 be a real number. A t-spanner for S is a directe...
A spanner graph on a set of points in R<sup><em>d</em></sup> provides shortest paths between any pai...
Given a set of n points TeX in the plane and a real value t>1 we show how to construct in time TeX a...
Let $S$ be a set of $n$ points in $\IR^d$ and let $t>1$ be a real number. A $t$-spanner for $S$ is a...
AbstractGiven a geometric graph G=(S,E) in Rd with constant dilation t, and a positive constant ε, w...
Let $(V,delta)$ be a finite metric space, where $V$ is a set of $n$ points and $delta$ is a distance...
The greedy t-spanner of a set of points in the plane is an undirected graph constructed by consideri...
Let $S$ be a set of $n$ points in $\IR^d$ and let $t>1$ be a real number. A $t$-spanner for $S$ is a...
We present a new optimal construction of a semi-separated pair decomposition (i.e., SSPD) for a set ...
A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set is a set {(A i ,B i )} of...
ABSTRACT The well-separated pair decomposition (WSPD) is a fundamental structure in computational ge...
We present an external-memory algorithm to compute a well-separated pair decomposition (WSPD) of a g...
We extend the classic notion of well-separated pair decomposition [P. B. Callahan and S. R. Kosaraju...
Abstract Given a point set in a fixed dimension, we note that a well-separated pair decomposition ca...
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk g...
AbstractLet S be a set of n points in Rd and lett>1 be a real number. A t-spanner for S is a directe...
A spanner graph on a set of points in R<sup><em>d</em></sup> provides shortest paths between any pai...
Given a set of n points TeX in the plane and a real value t>1 we show how to construct in time TeX a...
Let $S$ be a set of $n$ points in $\IR^d$ and let $t>1$ be a real number. A $t$-spanner for $S$ is a...
AbstractGiven a geometric graph G=(S,E) in Rd with constant dilation t, and a positive constant ε, w...
Let $(V,delta)$ be a finite metric space, where $V$ is a set of $n$ points and $delta$ is a distance...
The greedy t-spanner of a set of points in the plane is an undirected graph constructed by consideri...
Let $S$ be a set of $n$ points in $\IR^d$ and let $t>1$ be a real number. A $t$-spanner for $S$ is a...