2 citations · 2 across the 5 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.CG2024
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.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…