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.
@article{arxiv.2004.04207,
title = {Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020},
author = {Erik D. Demaine and Sándor P. Fekete and Phillip Keldenich and Dominik Krupke and Joseph S. B. Mitchell},
journal= {arXiv preprint arXiv:2004.04207},
year = {2020}
}