The Szemer??di-Trotter theorem states that if you have n points and m lines in the plane, then the number of incidences (that is, pairs (P,L) where P is a point in your collection, L is a line in your collection, and P is a point in L) is at most C(n + m + n^{2/3}m^{2/3}).