2026-09-30T02:35:15Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25913 2026-09-23T23:54:34Z ddc:004 open_access

Shadoks Approach to Parallel Reconfiguration of Triangulations (CG Challenge) da Fonseca, Guilherme D. Feschet, Fabien Gerard, Yan Exact algorithm SAT MaxSAT heuristic computational geometry We describe the methods used by Team Shadoks to win the CG:SHOP 2026 Challenge on parallel reconfiguration of planar triangulations. Our approach combines exact methods based on SAT with several greedy heuristics, and also makes use of SAT and MaxSAT for solution improvement. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Guilherme D. da Fonseca and Fabien Feschet and Yan Gerard 2026 Is Part Of LIPIcs, Volume 367, 42nd International Symposium on Computational Geometry (SoCG 2026) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2026.107 urn:nbn:de:0030-drops-259130 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.107 eng https://creativecommons.org/licenses/by/4.0/legalcode