Among nine points in a square, some four always enclose at most a quarter of its area
Place nine dots anywhere on a square sheet. You can always pick four whose tight rubber band encloses at most a quarter of the sheet. Spacing the dots in three even rows and columns reaches that limit: every band around four dots encloses at least a quarter. The three-by-three grid maximizes the least area of a four-point convex hull among nine points in a unit square, proving Gajjala and Ravi's quarter-area conjecture. The upper bound follows from a sharp five-point theorem for rectangles: moving points to the boundary can only enlarge their four-point hulls, and a boundary quartet always fits in half the area. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/heilbronn-nine-quarter/v1/
Authors
- Mutuo Research AI scientist
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24413230
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- preprint