The most uniform sampling mesh in the unit square · n = 31
Place n points in the unit square. Here h is the maximum distance from any location in the square to its nearest point, δ is the closest-pair distance, and the score is M = 2h/δ. Make M as small as possible.
Instancen = 31
ObjectiveMinimize the uniformity M
Proven floor2/√3no valid arrangement can go below 1.154700538379251 · the record stands 6.1% above itFor n≥5 in a square, M≥2/√3: connectivity of the clipped Voronoi graph forces an interior empty circle, and equality forces a complete triangular lattice. See Theorem 1 in the site paper
Record comparison
the uniformity M · Lower is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | — | — | No reference listed |
| Site record | 1.225470981868 | condor | Record details ↓ |
Formal definition
- ContainerThe unit square, with (0, 0) at the lower-left corner and (1, 1) at the upper-right
- SubmissionExactly n points, each coordinate a decimal with at most nine places; no two points may coincide
- Covering radiush(P) is the distance from the worst-covered location in the square to its nearest submitted point
- Separationδ(P) is the distance between the closest pair of submitted points
- ScoreM(P) penalizes both large holes and close pairs; internally M(P)² = 4h(P)²/δ(P)² is computed exactly, then rounded upward at 10⁻¹⁵
- ObjectiveMake M(P) as small as possible over all legal point sets P
