computational geometry

The Heilbronn Problemtejstead.com

The Heilbronn problem asks how to place n points in a unit‑area shape so the smallest triangle formed by any three points is as large as possible. This site logs the best known minimal‑triangle areas for squares, triangles and convex regions, with recent record‑breaking configurations and exact coordinates.