论文信息 - On the Number of Incidences Between Points and Curves - 字舞流文

On the Number of Incidences Between Points and Curves

We apply an idea of Szekely to prove a general upper bound on the number of incidences between a set of m points and a set of n ‘well-behaved’ curves in the plane.

Micha Sharir | János Pach | M. Sharir | J. Pach

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

[2] R. Canham. A theorem on arrangements of lines in the plane , 1969 .

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

[4] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .

[5] Micha Sharir,et al. Repeated Angles in the Plane and Related Problems , 1992, J. Comb. Theory, Ser. A.

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

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

[8] E. Szemerédi,et al. Unit distances in the Euclidean plane , 1984 .