论文信息 - Distinct Distances in the Plane

Distinct Distances in the Plane

It is shown that every set of n points in the plane has an element from which there are at least cn6/7 other elements at distinct distances, where c>0 is a constant. This improves earlier results of Erdős, Moser, Beck, Chung, Szemerédi, Trotter, and Székely.

Csaba D. Tóth | József Solymosi | J. Solymosi

[1] János Pach,et al. Combinatorial Geometry , 2012 .

[2] P. Erdös. On Sets of Distances of n Points , 1946 .

[3] E. Szemerédi,et al. Crossing-Free Subgraphs , 1982 .

[4] Micha Sharir,et al. On the Number of Incidences Between Points and Curves , 1998, Combinatorics, Probability and Computing.

[5] Leonidas J. Guibas,et al. Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[6] Endre Szemerédi,et al. Extremal problems in discrete geometry , 1983, Comb..

[7] Endre Szemerédi,et al. The number of different distances determined by a set of points in the Euclidean plane , 1992, Discret. Comput. Geom..

[8] László A. Székely,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.

[9] József Beck,et al. On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry , 1983, Comb..

[10] Leo Moser,et al. On The Different Distances Determined By n Points , 1952 .

[11] F. Thomas Leighton,et al. Complexity Issues in VLSI , 1983 .

[12] L. A. Oa,et al. Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[13] Fan Chung Graham,et al. The Number of Different Distances Determined by n Points in the Plane , 1984, J. Comb. Theory, Ser. A.