PROJECT EULER · #0742
Minimum Area of a Convex Grid Polygon
A symmetrical convex grid polygon is a polygon such that:
- All its vertices have integer coordinates.
- All its internal angles are strictly smaller than
. - It has both horizontal and vertical symmetry.
For example, the left polygon is a convex grid polygon which has neither horizontal nor vertical symmetry, while the right one is a valid symmetrical convex grid polygon with six vertices:

Define
You are given
Find
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.