Area-Optimal Simple Polygonalizations: The CG Challenge 2019

Abstract

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 𝑛 points in the plane. Both problems are known to be N P-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 𝑛 = 10 all the way to 𝑛 = 1, 000, 000.CCS Concepts: • Theory of computation → Design and analysis of algorithms; Computational Geometry.