The smallest triangle in an annulus · n = 13
Place n points inside an annulus with outer radius 1 and inner radius 0.5 so that the smallest triangle formed by any three points has the largest possible area.
Record comparison
the smallest triangle's area · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | — | — | No reference listed |
| Site record | 0.0856582356085381205 | zzzcy | Record details ↓ |
Formal definition
- ContainerAn annulus centered at (1, 1) with outer radius 1 and inner radius 0.5 (i.e. 0.5 ≤ ‖p − (1, 1)‖ ≤ 1, with the central disk of radius 0.5 removed)
- SubmissionExactly n points, with no three collinear
- ConstraintsEvery point must lie inside the container or on its boundary
- ScoreA(P) is the minimum triangle area over all triples of points; internally, the verifier compares 2A(P) using exact arithmetic
- ObjectiveMaximize A(P)