Distinct distances in three and higher dimensions

Combinatorics Probability and Computing

Volumn 13, Issue 3, 2004, Pages 283-293

  Aronov, Boris ^a   Pach, János ^b,c   Sharir, Micha ^c,d   Tardos, Gabor ^e  

^a POLYTECHNIC UNIVERSITY   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c NEW YORK UNIVERSITY   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

^e INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

DISTINCT DISTANCES; PIGEONHOLE PRINCIPLE; THREE-DIMENSIONAL SPACES; THREE-DIMENSIONAL SPHERES;

FUNCTION EVALUATION; FUNCTIONS; GEOMETRY; MATHEMATICAL MODELS; MOTION PLANNING; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

SET THEORY;

EID: 3142567132     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006091     Document Type: Article

References (19)

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