The k most frequent distances in the plane

Discrete and Computational Geometry

Volumn 28, Issue 4, 2002, Pages 639-648

  Solymosi, József ^a   Tardos, Gábor ^b   Tóth, Csaba D ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036883299     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2896-z     Document Type: Article

References (18)

1. M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi, Crossing-free graphs, Ann. Discrete Math. 12 (1982), 9-12.
2. T. Akutsu, H. Tamaki, and T. Tokuyama, Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets, Discrete Comput. Geom. 20 (1998), 307-331.
3. B. Aronov and M. Shark, Cutting circles into pseudo-segments and improved bounds for incidences, Discrete Comput. Geom., this issue, pp. 475-490.
4. J. Beck, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdos in combinatorial geometry, Combinatorial 3 (1983), 281-297.
5. F. R. K. Chung, Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs, Discrete Comput. Geom. 4 (1989), 183-190.
6. K. L. Clarkson, H. Edelsbrunner, L. J. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom. 5 (1990), 99-160.
7. P. Erdos, On sets of distances of n points, Amer. Math. Monthly 53 (1946), 248-250.
8. F. T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, MA, 1983.
9. J. Pach and P. K. Agarwal, Combinatorial Geometry, Wiley, New York, 1995.
10. J. Pach and M. Sharir, On the number of incidences between points and curves, Combin. Probab. Comput. 7(1998), 121-127.
11. J. Pach and G. Tóth, Graphs drawn with few crossings per edge, Combinatorica 17 (1997), 427-439.
12. J. Pach and G. Töth, Which crossing number is it anyway?, J. Combin. Theory Ser. B 80 (2000), 225-246.
13. G. Prudy, Two results about points, lines, and planes, Discrete Math. 60 (1986), 215-218.
14. J. Solymosi and Cs. D. Tóth, Distinct distances in the plane, Discrete Comput. Geom. 25(4) (2001), 629-634.
15. L. Székely, Crossing numbers and hard Erdos problems in discrete geometry, Combin. Probab. Comput. 6(1997), 353-358.
16. E. Szemerédi and W. T. Trotter, Extremal problems in discrete geometry, Combinatorica 3 (1983), 381-392.
17. G. Tardos, On distinct sums and distinct distances, submitted. Available online at http://www.renyi.hu/̃tardos/distinctsums.ps.
18. Cs. D. Tóth, The Szemerédi-Trotter theorem in the complex plane, submitted.