希尔布伦问题

希尔布伦问题
The Heilbronn Problem

原始链接: https://math.tejstead.com/heilbronn/

## 海尔布伦问题在单位面积区域内放置 \(n\) 个点，使任意三个点所确定的三角形中面积最小者达到最大可能值，记为 \(A(n)\)。本站收集三类经典容器——正方形、三角形和最优凸区域——中的最佳已知配置。每个条目均包含精确坐标、对称性和全等分析、已发表证明的参考文献，以及浏览器内的有理数运算验证器。 ## 最新纪录最近十项改进。新纪录也通过 Atom feed 发布。 ## 最佳已知值数值截断至小数点后 8 位；▲ 表示已证明为最优的条目。

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.

Recent records

The ten most recent improvements. New records are also published as an Atom feed.

Best known values

Truncated to 8 decimals; ▲ marks entries proven optimal.