Small Triangles

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