3 citations · 9 across the 9 of their papers we have counts for
3 papers · 1 filter
Short Flip Sequences to Untangle Segments in the Plane
Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier
A (multi)set of segments in the plane may form a TSP tour, a matching, a tree, or any multigraph. If two segments cross, then we can reduce the total length with the following flip…
The Calissons Puzzle
Jean-Marie Favreau, Yan Gerard, Pascal Lafourcade +1
In 2022, Olivier Longuet, a French mathematics teacher, created a game called the \textit{calissons puzzle}. Given a triangular grid in a hexagon and some given edges of the grid,…
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
Loïc Crombez, Guilherme D. da Fonseca, Florian Fontan +8
CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments. Surprisingly, the to…