{Engineering Greedy Heuristics and Simulated Annealing Methods for the Median Triangulation Under the Parallel Flip Distance}

We present our approach for the CG:SHOP 2026 challenge. In this international challenge, the goal was to find a median triangulation for a set of triangulations in the parallel flip reconfiguration graph of all triangulations of an underlying point set. Our simulated-annealing-based approach makes use of two ingredients: a heuristic edge selection for approximating the parallel flip distance of two given triangulations, and a heuristic procedure to generate good initial triangulations.

Citation information

Conradi, Jacobus; Kolbe, Benedikt; Mayer, Philip; Sauer, Jonas; Spalding-Jamieson, Jack: {Engineering Greedy Heuristics and Simulated Annealing Methods for the Median Triangulation Under the Parallel Flip Distance}, 42nd International Symposium on Computational Geometry (SoCG 2026), 2026, 367, May, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.106, Conradi.etal.2026a,