19 citations · 66 across the 26 of their papers we have counts for
5 papers · 1 filter
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…
Global Curve Simplification
Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler +2
Due to its many applications, \emph{curve simplification} is a long-studied problem in computational geometry and adjacent disciplines, such as graphics, geographical information s…
Convex Hull Formation for Programmable Matter
Joshua J. Daymude, Robert Gmyr, Kristian Hinnenthal +3
We envision programmable matter as a system of nano-scale agents (called particles) with very limited computational capabilities that move and compute collectively to achieve a des…
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…
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region
Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman +1
The beacon model is a recent paradigm for guiding the trajectory of messages or small robotic agents in complex environments. A beacon is a fixed point with an attraction pull that…