2 citations · 2 across the 5 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CG2022★ 2 cited
On the Longest Flip Sequence to Untangle Segments in the Plane
Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier
A set of segments in the plane may form a Euclidean TSP tour or a matching, among others. Optimal TSP tours as well as minimum weight perfect matchings have no crossing segments, b…
cs.CG2022
Complexity Results on Untangling Red-Blue Matchings
Arun Kumar Das, Sandip Das, Guilherme D. da Fonseca +2
Given a matching between n red points and n blue points by line segments in the plane, we consider the problem of obtaining a crossing-free matching through flip operations that re…