Maximum rectilinear convex subsets

Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero +4

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erdős-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2…