On the Number of Incidences between Points and Curves

Combinatorics Probability and Computing

Volumn 7, Issue 1, 1998, Pages 121-127

  Pach, János ^a,b   Sharir, Micha ^a,c  

^a NEW YORK UNIVERSITY   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032327160     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003192     Document Type: Article

References (10)

1. Ajtai, M., Chvátal, V., Newborn, M. and Szemerédi, E. (1982) Crossing-free subgraphs. Ann. Discrete Math. 12 9-12.
2. Canham, R. (1969) A theorem on arrangements of lines in the plane. Israel J. Mathematics 7 393-397.
3. 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.
4. Kovári, T., Sós, V. T. and Turán, P. (1954) On a problem of Zarankiewicz. Colloq. Math. 3 50-57.
5. Leighton, F. T. (1983) Complexity Issues in VLSI, Foundations of Computing Series, MIT Press, Cambridge, MA.
6. Pach, J. and Agarwal, P. K. (1995) Combinatorial Geometry, Wiley, New York.
7. Pach, J. and Sharir, M. (1992) Repeated angles in the plane and related problems. J. Combin. Theory, Ser. A 59 12-22.
8. Székely, L. A. (1997) Crossing numbers and hard Erdos problems in discrete geometry. Combinatorics, Probability and Computing 6, 353-358.
9. Szemerédi, E. and Trotter, W. T. (1983) Extremal problems in discrete geometry. Combinatorial 3 381-392.
10. 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, New York, pp. 293-303.