4

Given a list of integer coordinates find the area of the biggest convex polygon you can construct from the list such that every vertex is in the list and no element of the list is contained within the polygon.
Example:
(0, 0) (8, 0) (0, 1) (3, 1) (7, 1) (1, 2) (5, 2) (9, 2) (2, 3) (5, 3) (7,...