Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023

Authors

DOI:

https://doi.org/10.57717/cgt.v5i4.115

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.

Downloads

Published

2026-02-19

How to Cite

Fekete, S. P., Keldenich, P., Krupke, D., & Schirra, S. (2026). Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023. Computing in Geometry and Topology, 5(4), 2:1–2:12. https://doi.org/10.57717/cgt.v5i4.115

Issue

Vol. 5 No. 4 (2026)

Section

Original Research Articles

Categories

License

Copyright (c) 2026 Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors who publish with this journal agree to the following terms:

Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).