Distinct distances in homogeneous sets

Authors:
Jazsef Solymosi;Van H. Vu
Affiliations:
University of California, San Diego, La Jolla, California;University of California, San Diego, La Jolla, California
Venue:
Proceedings of the nineteenth annual symposium on Computational geometry
Year:
2003

Citing 1
Cited 2

Combinatorial complexity bounds for arrangements of curves and spheres

Discrete & Computational Geometry - Special issue on the complexity of arrangements

Distinct distances in three and higher dimensions

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Distinct Distances in Three and Higher Dimensions

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the number of distinct distances in a well-distributed set of n points in Rd is O (n2/d-1/d2) which is not far from the best known upper bound O(n2/d).