The smallest triangle in a disc · n = 10
Place n points inside a circle of radius 1 so that the smallest triangle formed by any three of them is as large as possible.
Formal definition
- ContainerThe container is a circle of radius 1 centred at (1, 1), so coordinates run from 0 to 2.
- SubmissionExactly n points, no three collinear
- ConstraintsEvery point lies inside the container or on its boundary
- ObjectiveMake the smallest triangle over all triples as large as possible; compared internally by twice the area, exactly