The biggest little polygon · n = 14
Take n points, no two further apart than 1, and make the convex polygon they span as large as possible; every point must be a vertex of the hull.
Formal definition
- ContainerNo container: the one global constraint is that no two points are further than 1 apart; coordinates are written inside [0, 1.5] × [0, 1.5]
- SubmissionExactly n points
- ConstraintsAll pairwise distances at most 1; every point a genuine hull vertex — on another pair's segment or inside does not count
- ObjectiveMake the polygon area as large as possible; compared internally by twice the area, exactly