9 citations · 10 across the 4 of their papers we have counts for
6 papers
Optimal Motion Planning for Two Square Robots in a Rectilinear Environment
Pankaj K. Agarwal, Mark de Berg, Benjamin Holmgren +2
Let be a rectilinear polygonal environment (that is, a rectilinear polygon potentially with holes) with a total of vertices, and let be…
Near-Shortest Path Routing in Hybrid Communication Networks
Sam Coy, Artur Czumaj, Michael Feldmann +5
Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20…
Minimum Scan Cover and Variants -- Theory and Experiments
Kevin Buchin, Sándor P. Fekete, Alexander Hill +5
We consider a spectrum of geometric optimization problems motivated by contexts such as satellite communication and astrophysics. In the problem Minimum Scan Cover with Angular Cos…
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
Kristian Hinnenthal, Christian Scheideler, Martijn Struijs
In this paper we present various distributed algorithms for LP-type problems in the well-known gossip model. LP-type problems include many important classes of problems such as (in…
On the hardness of computing an average curve
Kevin Buchin, Anne Driemel, Martijn Struijs
We study the complexity of clustering curves under -median and -center objectives in the metric space of the Fréchet distance and related distance measures. Building upon rec…
Approximating -center clustering for curves
Kevin Buchin, Anne Driemel, Joachim Gudmundsson +4
The Euclidean -center problem is a classical problem that has been extensively studied in computer science. Given a set of points in Euclidean space, the probl…