Area-Optimal Simple Polygonalizations: The CG Challenge 2019

11/14/2021

∙

by   Erik D. Demaine, et al.

∙

0

∙

share

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.