Heilbronn triangle problem

In discrete geometry and discrepancy theory, the Heilbronn triangle problem asks how to place $n$ points in a region of the plane, such as a square, so that the smallest of the triangles formed by triples of the points is as large as possible. It is named after Hans Heilbronn, who conjectured that this largest achievable area shrinks at least as quickly as the inverse square of the number of points. Komlós, Pintz, and Szemerédi disproved the conjecture in 1982, finding placements whose smallest triangle is larger by a logarithmic factor, but the asymptotic growth rate of the area remains unknown.