1. In the plane, $m$ points have no three points collinear, and their convex hull is an $n$-sided polygon. By appropriately connecting lines, a grid region composed of triangles can be obtained. Let the number of non-overlapping triangles be $f(m, n)$. Then $f(2016,30)=$ $\qquad$
One, 1.4000.
Since no three points are collinear, we have
$$
f(m, n)=(n-2)+2(m-n)=2 m-n-2 \text {. }
$$

Therefore, $f(2016,30)=2 \times 2016-30-2=4000$.