# Area-Optimal Simple Polygonalizations: The CG Challenge 2019

arXiv: https://arxiv.org/abs/2111.07304 · HTML: https://mlsanity.com/paper/2111.07304/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Nov 2021.

## Built on by (most cited first, 1 of 1)

- [Visual Diffusion Models are Geometric Solvers](https://mlsanity.com/paper/2510.21697/) (2025)

## Abstract (arXiv)

We give an overview of theoretical and practical aspects of finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of n points in the plane. Both problems are known to be NP-hard and were the subject of the 2019 Computational Geometry Challenge, which presented the quest of finding good solutions to more than 200 instances, ranging from n = 10 all the way to n = 1, 000, 000.