Spreading points in a right triangle · n = 15
Place n points inside a right isosceles triangle with legs 1, maximizing the smallest distance between any two of them.
Formal definition
- ContainerThe container is a right isosceles triangle with legs of length 1: the right angle sits at the origin (0, 0) and the other vertices are (1, 0) and (0, 1).
- 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