2 papers
cs.CG2025
Sweeping -monotone pseudolines
Therese Biedl, Erin Chambers, Irina Kostitsyna +1
We study the problem of sweeping a pseudoline arrangement with -monotone curves with a rope (an -monotone curve that connects the points at infinity). The rope can move b…
cs.CG2025
Finding a Shortest Curve that Separates Few Objects from Many
Therese Biedl, Éric Colin de Verdière, Fabrizio Frati +2
We present a fixed-parameter tractable (FPT) algorithm to find a shortest curve that separates some polygons from others. Formally, the input is a set of interior-disjoint simple p…