3 papers
cs.CG2021
Covering a set of line segments with a few squares
Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen +3
We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments…
cs.CG2018
Convex partial transversals of planar regions
Vahideh Keikha, Mees van de Kerkhof, Marc van Kreveld +6
We consider the problem of testing, for a given set of planar regions and an integer , whether there exists a convex shape whose boundary intersects at least region…
cs.CG2018
On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance
Marc van Kreveld, Maarten Löffler, Lionov Wiratma
We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fréchet distance. Interestingly, no previous authors studied line simpl…