We describe the methods used by Team Shadoks to win the CG:SHOP 2026 Challenge on parallel reconfiguration of planar triangulations. An instance is a collection of triangulations of a common point set. We must select a center triangulation and find short parallel-flip paths from each input triangulation to the center, minimizing the sum of path lengths. Our approach combines exact methods based on SAT with several greedy heuristics, and also makes use of SAT and MaxSAT for solution improvement. We present a SAT encoding for bounded-length paths and a global formulation for fixed path-length vectors. We discuss how these components interact in practice and summarize the performance of our solvers on the benchmark instances.

翻译：本文描述了Shadoks团队在CG:SHOP 2026挑战赛（平面三角剖分并行重构问题）中采用的解题方法。该问题涉及一个公共点集的多个三角剖分实例，需选择一个中心三角剖分，并为每个输入三角剖分找到至中心的最短并行翻转路径，目标是使路径长度总和最小化。我们的方法将基于SAT的精确方法与多种贪心启发式算法相结合，并利用SAT和MaxSAT进行解优化。我们提出了有界长度路径的SAT编码方案，以及固定路径长度向量的全局形式化模型。文中讨论了这些组件在实际交互中的运行机制，并在基准实例上总结了求解器的性能表现。