2 citations · 2 across the 5 of their papers we have counts for
6 papers
Untangling Segments in the Plane
Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier
A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have…
Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
Therese Biedl, Stephane Durocher, Debajyoti Mondal +2
A conforming partition of a rectilinear n-gon P (possibly with holes) is a partition of P into rectangles without using Steiner points (i.e., all corners of all rectangles must lie…
Further Connectivity Results on Plane Spanning Path Reconfiguration
Valentino Boucard, Guilherme D. da Fonseca, Bastien Rivier
Given a finite set of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of and there is an edge between two vertices if…
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…
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…
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…