J. Urrutia

collaborators

2 papers

cs.CG2025

Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations

Carlos AlegrÃa-Galicia, David Orden, Carlos Seara +1

Let $P$ be a set of $n$ points in the plane. We compute the value of $I^¸ \in [0, 2 I ¨ )$ for which the rectilinear convex hull of $P$ , denoted by $R H_{I^} ¸ (P)$ , has minimum (or…

cs.CG2024

Maximum rectilinear convex subsets

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…