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.
翻译:我们概述了在飞机上找到一个最小(中区域)或最大(马克斯区域)的简单多边形(最低)或最大(马克斯区域)可能达到的一组n点的区域的理论和实践方面,这两个问题都是已知的NP硬问题,是2019年计算几何挑战的主题,它为200多个实例提供了寻找良好解决办法的尝试,从n=10到n=1 000 000 000。