In $1979$ Conway, Croft, Erd\H{o}s and Guy proved that every set $S$ of $n$ points in general position in the plane determines at least $\frac{n^3}{18}-O(n^2)$ obtuse angles and also presented a special set of $n$ points to show the upper bound $\frac{2n^3}{27}-O(n^2)$ on the minimum number of obtuse angles among all sets $S$. We prove that every set $S$ of $n$ points in convex position determines at least $\frac{2n^3}{27}-o(n^3)$ obtuse angles, hence matching the upper bound (up to sub-cubic terms) in this case. Also on the other side, for point sets with low rectilinear crossing number, the lower bound on the minimum number of obtuse angles is improved.