Document Open Access Logo

Shadoks Approach to Convex Covering (CG Challenge)

Author Guilherme D. da Fonseca

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2023.67.pdf
  • Filesize: 0.93 MB
  • 9 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Set cover
  • covering
  • polygons
  • convexity
  • heuristics
  • enumeration
  • simulated annealing
  • integer programming
  • computational geometry

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We describe the heuristics used by the Shadoks team in the CG:SHOP 2023 Challenge. The Challenge consists of 206 instances, each being a polygon with holes. The goal is to cover each instance polygon with a small number of convex polygons. Our general strategy is the following. We find a big collection of large (often maximal) convex polygons inside the instance polygon and then solve several set cover problems to find a small subset of the collection that covers the whole polygon.

Cite As Get BibTex

Guilherme D. da Fonseca. Shadoks Approach to Convex Covering (CG Challenge). In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 67:1-67:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.SoCG.2023.67

Author Details

Guilherme D. da Fonseca
  • LIS, Aix-Marseille Université, France

Funding

Work supported by the French ANR PRC grant ADDS (ANR-19-CE48-0005).

Acknowledgements

We would like to thank the Challenge organizers and other competitors for their time, feedback, and making this whole event possible. We would also like to thank the second year undergraduate students Rayis Berkat, Ian Bertin, Ulysse Holzinger, and Julien Jamme for coding a solution visualisation tool that allows you to view all our best solutions in https://pageperso.lis-lab.fr/guilherme.fonseca/cgshop23view/.

Supplementary Materials

References

  1. Mikkel Abrahamsen, William B. Meyling, and André Nusser. Constructing concise convex covers via clique covers. In 39th International Symposium on Computational Geometry (SoCG 2023), volume 258, pages 62:1-62-9, 2023. Google Scholar
  2. Coen Bron and Joep Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16(9):575-577, 1973. Google Scholar
  3. Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René Van Oostrum, and Chan-Su Shin. Guarding art galleries by guarding witnesses. International Journal of Computational Geometry & Applications, 16(02n03):205-226, 2006. Google Scholar
  4. IBM ILOG CPLEX. V22.1: User’s manual for CPLEX. International Business Machines Corporation, 2023. Google Scholar
  5. Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, and Stefan Schirra. Minimum coverage by convex polygons: The CG:SHOP challenge 2023, 2023. URL: http://arxiv.org/abs/2303.07007.
  6. Ina Koch. Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science, 250(1-2):1-30, 2001. Google Scholar
  7. O. Tange. Gnu parallel - the command-line power tool. ;login: The USENIX Magazine, 36(1):42-47, February 2011. URL: http://www.gnu.org/s/parallel.
  8. The CGAL Project. CGAL User and Reference Manual. CGAL Editorial Board, 5.5.1 edition, 2022. URL: https://doc.cgal.org/5.5.1/Manual/packages.html.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact