9 citations · 22 across the 20 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CG2019★ 2 cited
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)…
cs.CG2019
Matching points with disks with a common intersection
Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara +1
We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and…