Abstract Heilbronn's triangle problem is a classical question in discrete geometry. It asks to determine the smallest number for which every collection in points in the unit square spans a triangle with area at most . We outline old and new developments around this problem, discuss related questions and highlight connections to recent developments in combinatorics and analysis.
Dmitrii Zakharov (Sun,) studied this question.