Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023
Computational Geometry
2023-03-14 v1 Data Structures and Algorithms
Abstract
We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a problem with a long-standing tradition in Computational Geometry.
Keywords
Cite
@article{arxiv.2303.07007,
title = {Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023},
author = {Sándor P. Fekete and Phillip Keldenich and Dominik Krupke and Stefan Schirra},
journal= {arXiv preprint arXiv:2303.07007},
year = {2023}
}
Comments
12 pages, 6 figures, 1 table. arXiv admin note: text overlap with arXiv:2203.07444