Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020
arXiv:2004.04207
Abstract
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.
8 pages, 3 figures, 1 table