Spreading points in an annulus · n = 17
Place n points inside an annulus with outer radius 1 and inner radius 0.5, maximizing the smallest distance between any two of them.
Formal definition
- ContainerThe container is an annulus of outer radius 1 and inner radius 0.5 centred at (1, 1), so coordinates run from 0 to 2 and the disc of radius 0.5 in the middle is not part of it.
- SubmissionExactly n points, no two coinciding
- ConstraintsEvery point lies inside the container or on its boundary
- ObjectiveMake the smallest pairwise distance as large as possible; compared internally by its square, exactly