88 citations · 452 across the 85 of their papers we have counts for
5 papers · 1 filter
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game
Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics +1
We study competitive location problems in a continuous setting, in which facilities have to be placed in a rectangular domain of normalized dimensions of and , and…
Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020
Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich +2
We give an overview of the 2020 Computational Geometry Challenge, which targeted the problem of partitioning the convex hull of a given planar point set P into the smallest number…
Probing a Set of Trajectories to Maximize Captured Information
Sándor P. Fekete, Alexander Hill, Dominik Krupke +4
We study a trajectory analysis problem we call the Trajectory Capture Problem (TCP), in which, for a given input set of trajectories in the plane, and an integer $k\geq…
Minimum Scan Cover with Angular Transition Costs
Sándor P. Fekete, Linda Kleist, Dominik Krupke
We provide a comprehensive study of a natural geometric optimization problem motivated by questions in the context of satellite communication and astrophysics. In the problem Minim…
Worst-Case Optimal Covering of Rectangles by Disks
Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich +2
We provide the solution for a fundamental problem of geometric optimization by giving a complete characterization of worst-case optimal disk coverings of rectangles: For any $λ\geq…