Abstract
In this chapter we study a very natural problem of combinatorial geometry: the maximum possible number of incidences between m points and n lines in the plane. In addition to its mathematical appeal, this problem and its relatives are significant in the analysis of several basic geometric algorithms. In the proofs we encounter number-theoretic arguments, results about graph drawing, the probabilistic method, forbidden subgraphs, and line arrangements.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Matoušek, J. (2002). Incidence Problems. In: Matoušek, J. (eds) Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol 212. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0039-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0039-7_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95374-8
Online ISBN: 978-1-4613-0039-7
eBook Packages: Springer Book Archive