3 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 encloses a set of k required objects in the plane while paying a penalty for enclosing unwanted…
cs.CG2024
Morphing Planar Graph Drawings via Orthogonal Box Drawings
Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an -vertex pla…