The smallest triangle in a half-disc · n = 8
Place n points inside a half-disc 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 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 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