Shadoks Approach to Parallel Reconfiguration of Triangulations (CG Challenge)

Guilherme D. da Fonseca; Fabien Feschet; Yan Gérard

doi:10.4230/lipics.socg.2026.107

January 1, 2026Open Access

Shadoks Approach to Parallel Reconfiguration of Triangulations (CG Challenge)

View Full Paper

Ask AI

Bookmark

Share

Key Points

This research aims to detail the strategies employed by Team Shadoks to excel in the CG:SHOP 2026 Challenge focused on triangulations.
Combined exact methods based on SAT with greedy heuristics.
Utilized SAT and MaxSAT for enhancing solutions.
Focused on the parallel reconfiguration of planar triangulations.
Achieved significant performance improvements in triangulation tasks.
Demonstrated a successful integration of exact methods with heuristics.
Highlighted the effectiveness of the SAT framework in computational challenges.

Implication

Demonstrates effective triangulation methods, suggesting advantages for computational challenges.

Abstract

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.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Fonseca et al. (2026) studied this question.

synapsesocial.com/papers/6a192ea9fab5b468c4417e26 https://doi.org/10.4230/lipics.socg.2026.107

View Full Paper

Ask AI

Bookmark

Share

Shadoks Approach to Parallel Reconfiguration of Triangulations (CG Challenge)

Key Points

Implication

Abstract

Discussion

Cite This Study

Shadoks Approach to Parallel Reconfiguration of Triangulations (CG Challenge)

Key Points

Implication

Abstract

Discussion

Cite This Study

Keep reading

More related papers

Keep reading

More related papers