From charlesreid1

Revision as of 21:19, 17 June 2026 by Admin (talk | contribs) (Create Project Euler/252 - Convex Holes (via create-page on MediaWiki MCP Server))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem Statement

Convex Holes

Given a set of points on a plane, we define a convex hole to be a convex polygon having as vertices any of the given points and containing no other of the given points in its interior (as well as having no given points on its boundary besides the vertices).

Given 500 points generated by a pseudo-random number generator, find the maximum area of a convex hole.

Give your answer to 1 decimal place.

Flags