Constructing Concise Convex Covers via Clique Covers
DOI:
https://doi.org/10.57717/cgt.v5i4.76Abstract
This work is the full version describing the winning implementation of the CG:SHOP 2023 Challenge. The topic of the Challenge was the convex cover problem: given a polygon P (with holes), find a minimum-cardinality set of convex polygons whose union equals P.
We use a three-step approach:
- Create a suitable triangulation of P.
- Compute a visibility graph of the triangles.
- Solve a vertex clique cover problem on the visibility graph, from which we then derive the convex cover.
This way we capture the geometric difficulty in the first step and the combinatorial difficulty in the third step.
Downloads
Published
How to Cite
Issue
Section
Categories
License
Copyright (c) 2026 Mikkel Abrahamsen, William Bille Meyling, André Nusser
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).
