Spreading points in a half-disc · n = 11
Place n points inside a semicircle of radius 1 so that the minimum distance between any two points is as large as possible.
Record comparison
the smallest distance between two points · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | — | — | No reference listed |
| Site record | 0.51763809 | HwaterB | Record details ↓ |
Formal definition
- ContainerAn upper half-disk of radius 1: its diameter lies along y = 0 from (0, 0) to (2, 0), centered at (1, 0), with the circular arc in y ≥ 0
- SubmissionExactly n distinct points
- ConstraintsEvery point lies inside the half-disk or on its boundary
- Scoreδ(P) is the minimum Euclidean distance over all point pairs (the verifier compares δ(P)² using exact arithmetic internally)
- ObjectiveMaximize the minimum pairwise distance δ(P)