1 citations · 1 across the 7 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2024
Happy Ending: An Empty Hexagon in Every Set of 30 Points
Marijn J. H. Heule, Manfred Scheucher
Satisfiability solving has been used to tackle a range of long-standing open math problems in recent years. We add another success by solving a geometry problem that originated a c…
cs.CG2023
Bichromatic Perfect Matchings with Crossings
Oswin Aichholzer, Stefan Felsner, Rosna Paul +2
We consider bichromatic point sets with red and blue points and study straight-line bichromatic perfect matchings on them. We show that every such point set in convex posit…
cs.CG2023
Using SAT to study plane Hamiltonian substructures in simple drawings
Helena Bergold, Stefan Felsner, Meghana M. Reddy +1
In 1988 Rafla conjectured that every simple drawing of a complete graph contains a plane, i.e., non-crossing, Hamiltonian cycle. The conjecture is far from being resolved. Th…