1 citations · 1 across the 1 of their papers we have counts for
4 papers · 1 filter
Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke +1
We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (pos…
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…
Minimizing the Continuous Diameter when Augmenting a Geometric Tree with a Shortcut
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari +2
We augment a tree with a shortcut to minimize the largest distance between any two points along the resulting augmented tree . We study this problem in a continuous…
Network Farthest-Point Diagrams
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel +5
Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shorte…