Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Randomized algorithms
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Journal of Algorithms
A practical approach for computing the diameter of a point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Geometric Separator Theorems and Applications
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Geometric Spanner Networks
European Journal of Combinatorics
Region-Fault Tolerant Geometric Spanners
Discrete & Computational Geometry
Spanners for geometric intersection graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We present a new optimal construction of semi-separated pair decomposition (SSPD) for a set of n points in IRd. 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(log2 n) that has a separator of size O(n1-1/d).