Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020
Not on the map. Why?
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 8 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Solving Convex Partition Visual Jigsaw Puzzlescited by 1
- 2025Solving Convex Partition Visual Jigsaw Puzzles6 Nov 2025