Spreading points in a half-disc · n = 12
Place n points inside a half-disc of radius 1, maximizing the smallest distance between any two of them.
Formal definition
- ContainerThe container is a half-disc of radius 1: its diameter lies along y = 0 from (0, 0) to (2, 0), centred at (1, 0), with the arc above.
- 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