19 citations · 26 across the 16 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CG2022
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours
Sándor P. Fekete, Dominik Krupke, Michael Perk +2
For a given polygonal region , the Lawn Mowing Problem (LMP) asks for a shortest tour that gets within Euclidean distance 1 of every point in ; this is equivalent to comp…
cs.CG2022
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke +1
We give an overview of the 2022 Computational Geometry Challenge targeting the problem Minimum Partition into Plane Subsets, which consists of partitioning a given set of line segm…