Distinct distances in three and higher dimensions

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 541-546

  Aronov, Boris ^a   Pach, János ^b   Sharir, Micha ^b,c   Tardos, Gábor ^d  

^a POLYTECHNIC UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Distinct distances; Incidences; Point configurations

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING; THEOREM PROVING;

THREE-DIMENSIONAL SPHERES;

COMPUTATIONAL GEOMETRY;

EID: 0038107574     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780621     Document Type: Conference Paper

References (18)

1. B. Aronov, V. Koltun and M. Sharir, Incidences between points and circles in three and higher dimensions, Discrete Comput. Geom., submitted. (An earlier version appeared in Proc. 18th ACM Symp. on Computational Geometry (2002), 116-122.).
2. B. Chazelle and J. Friedman, A deterministic view of random sampling and its use in geometry, Combinatorica 10 (1990), 229-249.
3. F. Chung, E. Szemerédi, and W. T. Trotter, The number of distinct distances determined by a set of points in the Euclidean plane, Discrete Comput. Geom. 7 (1992), 1-11.
4. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom. 5 (1990), 99-160.
5. G. Elekes, A note on the number of distinct distances, Periodica Math. Hung. 38(3) (1999), 173-177.
6. G. Elekes, Sums versus products in number theory, algebra and Erdos geometry, manuscript, 2001.
7. P. Erdos, On sets of distances of n points, Amer. Math. Monthly 53 (1946), 248-250.
8. P. Erdos, On some of my favourite theorems, in: Combinatorics, Paul Erdos is Eighty, Vol. 2 (D. Miklós et al., eds.), Bolyai Society Mathematical Studies 2, Budapest, 1996, 97-132.
9. N. H. Katz, An improvement of a lemma of Tardos, unpublished.
10. N. H. Katz and G. Tardos, Note on distinct sums and distinct distances, unpublished.
11. J. Matoušek, Lectures on Discrete Geometry, GTM Series, Springer Verlag, New York, 2002.
12. J. Pach and P.K. Agarwal, Combinatorial Geometry, Wiley, New York, 1995.
13. J. Solymosi and Cs. Tóth, Distinct distances in the plane, Discrete Comput. Geom. 25 (2001), 629-634.
14. J. Solymosi and V. Vu, Distinct distances in homogeneous sets, to appear in Proc. 19th ACM Sympos. Comput. Geom., 2003.
15. J. Spencer, E. Szemerédi, and W. T. Trotter, Unit distances in the Euclidean plane, in: Graph Theory and Combinatorics (B. Bollobás, ed.), Academic Press, New York, 1984, 293-303.
16. L. Székely, Crossing numbers and hard Erdos problems in discrete geometry, Combinatorics, Probability and Computing 6 (1997), 353-358.
17. E. Szemerédi and W. T. Trotter, Extremal problems in discrete geometry, Combinatorica 3 (1983), 381-392.
18. G. Tardos, On distinct sums and distinct distances, Advances in Mathematics, to appear.