GoKawiilWebsite catalogs best-known solutions to the Heilbronn triangle problem
A dedicated site now tracks record configurations for the Heilbronn Problem, which asks how to place n points in a unit-area region so the smallest triangle formed by any three points is as large as possible. It covers three standard containers—square, triangle, and optimal convex regions—providing exact coordinates, symmetry analysis, proof references, and an in-browser rational arithmetic verifier. The site also maintains a running list of recent record improvements and a feed for updates.