Heilbronn minimum triangle area · n = 12
Place n points in the unit square so that the smallest triangle formed by any three of them is as large as possible.
Formal definition
- ContainerThe unit square: the origin (0, 0) at its lower-left corner, (1, 1) at its upper right
- SubmissionExactly n points, no three collinear
- ConstraintsEvery point lies inside the square or on its boundary
- ObjectiveMake the smallest triangle over all triples as large as possible; compared internally by twice the area, exactly