On the complexity of arrangements of circles in the plane

Discrete and Computational Geometry

Volumn 26, Issue 4, 2001, Pages 465-492

  Alon, N ^a   Last, H ^b   Pinchasi, R ^b   Sharir, M ^a,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035623196     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0043-x     Document Type: Article

References (20)

1. P. K. Agarwal and J. Erickson, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry (B. Chazelle. J. E. Goodman and R. Pollack, Eds.), Contemporary Mathematics, Vol. 223, American Mathematical Society. Providence, RI, 1999, pp. 1-56.
2. P. K. Agarwal and J. Matoušek, On range searching with semialgebraic sets. Discrete Comput. Geom. 11 (1994), 393-418.
3. A. Bezdek, On the density of dual circle coverings, Geom. Dedicata 33 (1990), 227-238.
4. A. Bezdek, On the intersection points of unit circles, Amer. Math. Monthly 99 (1992), 779-780.
5. A. Bezdek, Incidence problems for points and unit circles, in Paul Erdos and His Mathematics (A. Sali, M. Simonovits and V. T. Sós, Eds.), J. Bolyai Math. Soc., Budapest, 1999. pp. 33-36.
6. A. Bezdek, On unit circles which avoid all but two points of a given pointset, European J. Combin., to appear.
7. A. Bezdek, F. Fodor and I. Talata, A Sylvester-type theorem about circles, Discrete Math., to appear.
8. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom. 5 (1990), 99-160.
9. K. Clarkson and P. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
10. J. Eckhoff, Helly, Radon and Carathéodory type theorems, in Handbook of Convex Geometry, Vol. A (P. M. Gruber and J. M. Wills, Eds.), North-Holland, Amsterdam, 1993, pp. 389-448.
11. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.
12. M. J. Katz and M. Sharir, An expander-based approach to geometric optimization, SIAM J. Comput. 26 (1997), 1384-1408.
13. J. Pach, Finite point configurations, in Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O'Rourke, Eds.), CRC Press, Boca Raton, FL, 1997, pp. 3-18.
14. J. Pach and P. K. Agarwal, Combinatorial Geometry, Wiley-Interscience, New York, 1995.
15. R. Pinchasi, Gallai-Sylvester theorem for pairwise-intersecting unit circles in the plane, Manuscript, 1999.
16. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
17. J. Spencer, E. Szemerédi and W. T. Trotter, Unit distances in the Euclidean plane, in Graph Theory and Combinatorics (B. Bollobás, Ed.), Academic Press, New York, 1984, pp. 293-303.
18. L. Székely, Crossing numbers and hard Erdos problems in discrete geometry, Combin. Probab. Comput 6 (1997), 353-358.
19. E. Szemerédi and W. Trotter, Jr., Extremal problems in discrete geometry, Combinatorica 3 (1983), 381-392.
20. H. Tamaki and T. Tokuyama, How to cut pseudo-parabolas into segments, Discrete Comput. Geom. 19 (1998), 265-290.