Improved bounds for incidences between points and circles
Proceedings of the twenty-ninth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Recently Guth and Katz ( arXiv:1011.4105, 2010) invented, as a step in their nearly complete solution of Erdős’s distinct distances problem, a new method for partitioning finite point sets in ℝ d , based on the Stone–Tukey polynomial ham-sandwich theorem. We apply this method to obtain new and simple proofs of two well known results: the Szemerédi–Trotter theorem on incidences of points and lines, and the existence of spanning trees with low crossing numbers. Since we consider these proofs particularly suitable for teaching, we aim at self-contained, expository treatment. We also mention some generalizations and extensions, such as the Pach–Sharir bound on the number of incidences with algebraic curves of bounded degree.