The Heilbronn Problem
2 days ago
- The Heilbronn Problem aims to place n points in a unit-area region to maximize the smallest triangle area formed by any three points.
- The site collects best known configurations for three classic containers: the square, the triangle, and optimal convex regions, with detailed entries including coordinates, symmetry analysis, references, and an in-browser verifier.
- A table of recent records shows improvements from September to October 2026, contributed by researchers such as Rob Gardiner, Alexandar Lackovic, and Marc-Emmanuel Coupvent des Graviers.
- Best known values are provided truncated to 8 decimals, with some entries marked as proven optimal.