论文标题
计算飞机上点集的凸线分区：CG：商店挑战2020
Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020
论文作者
论文摘要
我们概述了2020年的计算几何挑战，该挑战的目的是将给定平面点集p的凸壳划分为最小数量的凸面面的问题，因此，p的内部没有p的内部。
We give an overview of the 2020 Computational Geometry Challenge, which targeted the problem of partitioning the convex hull of a given planar point set P into the smallest number of convex faces, such that no point of P is contained in the interior of a face.
