CG#Hunters Approach to Central Triangulation Under Parallel Flip Operations (CG Challenge)

In the CG:SHOP 2026 Challenge, the goal is to compute a central triangulation for a given set of triangulations on the same point set while minimizing the sum of parallel flip distances. To address the problem, our team (CG#Hunters) constructs an initial solution by iteratively applying parallel flips to reduce the total number of crossings between the triangulations until none remain. To optimize these solutions, we shorten the paths by using a score-based greedy edge selection and refine the central triangulation via a large scale neighborhood search. Additionally, a representative-set-based approach is utilized to efficiently handle large instances. With these combined approaches, we achieved third place by successfully computing central triangulations with sufficiently short parallel flip paths for all 250 instances.