Area-Optimal Simple Polygonalizations: The CG Challenge 2019
Computational Geometry
2021-11-16 v1 Data Structures and Algorithms
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 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.
Cite
@article{arxiv.2111.07304,
title = {Area-Optimal Simple Polygonalizations: The CG Challenge 2019},
author = {Erik D. Demaine and Sándor P. Fekete and Phillip Keldenich and Dominik Krupke and Joseph S. B. Mitchell},
journal= {arXiv preprint arXiv:2111.07304},
year = {2021}
}
Comments
12 pages, 9 Futures, 1 table