Showing cs.CGShow all
3 papers · 1 filter
cs.CG2025
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…
cs.CG2025
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…
cs.CG2024
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…