The Heilbronn Problem
- Place n points in a unit-area region such that the smallest triangle determined by any three points achieves the largest possible area, A(n).
- This site collects the best known configurations across three classic containers: the square, the triangle, and optimal convex regions.
- Each entry includes exact coordinates, symmetry and congruence analysis, references to published proofs, and an in-browser rational arithmetic verifier.
Unverified
- Place n points in a unit-area region such that the smallest triangle determined by any three points achieves the largest possible area, A(n).
- This site collects the best known configurations across three classic containers: the square, the triangle, and optimal convex regions.
- Each entry includes exact coordinates, symmetry and congruence analysis, references to published proofs, and an in-browser rational arithmetic verifier.
Sources: Tejstead