Given a set of lines in $R^n$, we say that a point is $r$-rich if it lies in at least $r$ lines. We will prove an upper bound for the number of $2$-rich points in $R^3$, assuming that at most a certain amount of them can lie in an algebraic surface of some degree. This is another application of the cell decomposition theorem.