We will use the cell decomposition Theorem we proved last week to obtain
an estimate for the number of incidences between points and lines,
namely we will prove the Szemerédi-Trotter bound.

We will also introduce the notion of r-rich points in a set of lines and
prove a bound for the case r=2. This is the first step towards
understanding the proof of the Erdős distinct distances problem.