License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2023.66
URN: urn:nbn:de:0030-drops-179164
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/17916/
Abrahamsen, Mikkel ;
Bille Meyling, William ;
Nusser, André
Constructing Concise Convex Covers via Clique Covers (CG Challenge)
Abstract
This work describes 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: (1) Create a suitable partition of P. (2) Compute a visibility graph of the pieces of the partition. (3) 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.
BibTeX - Entry
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2023.66,
author = {Abrahamsen, Mikkel and Bille Meyling, William and Nusser, Andr\'{e}},
title = {{Constructing Concise Convex Covers via Clique Covers}},
booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)},
pages = {66:1--66:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-273-0},
ISSN = {1868-8969},
year = {2023},
volume = {258},
editor = {Chambers, Erin W. and Gudmundsson, Joachim},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17916},
URN = {urn:nbn:de:0030-drops-179164},
doi = {10.4230/LIPIcs.SoCG.2023.66},
annote = {Keywords: Convex cover, Polygons with holes, Algorithm engineering, Vertex clique cover}
}
