53 citations · 55 across the 3 of their papers we have counts for
3 papers
Maximum rectilinear convex subsets
Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero +4
Let be a set of points in the plane. We consider a variation of the classical Erdős-Szekeres problem, presenting efficient algorithms with running time and $O(n^2)…
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…
Compatible Geometric Matchings
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu +10
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing.…