Suppose we have a unit square $S$ that contains $n$ points. Assume we always have a point at each of the four corners. No we triangulate $S$ by adding non-intersecting segments between the points. That is, every face is a triangle.
Suppose that the resulting triangulation has the property that the smallest angle is greater than some constant $\phi$.
Given this, can we compute a lowerbound $f(n)$ on the minimum distance between the points?