A power improvement in the Heilbronn triangle lower bound

For every sufficiently large n, constructs n points in the unit square such that every triangle has area at least $n^{-2+c}$ for one absolute c > 0. This disproves the conjectured almost-n⁻² upper bound in Heilbronn's triangle problem, which asks how large the smallest determined triangle can be.