# Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020

arXiv: https://arxiv.org/abs/2004.04207 · HTML: https://mlsanity.com/paper/2004.04207/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Apr 2020.

## Built on by (most cited first, 1 of 1)

- [Solving Convex Partition Visual Jigsaw Puzzles](https://mlsanity.com/paper/2511.04450/) (2025)

## Abstract (arXiv)

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.