1. M. Ajtai, V. Chvátal, M. Newborn, andE. Szemerédi: Crossing-free subgraphs,Ann. Discrete Mathematics,12 (1982), 9?12.
2. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, andE. Welzl: Combinatorial complexity bounds for arrangements of curves and surfaces,Discrete and Computational Geometry,5 (1990), 99?160.
3. G. H. Hardy andE. M. Wright:An Introduction to the Theory of Numbers, University Press, Oxford, 1954.
4. T. Leighton:Complexity Issues in VLSI, Foundations, of Computing Series, MIT Press, Cambridge, MA, 1983.
5. J. Pach andP. K. Agarwal:Combinatorial Geometry, John Wiley, New York, 1995.