3 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 be a set of points in the plane. We compute the value of for which the rectilinear convex hull of , denoted by , has minimum (or…
cs.CG2024
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.CG2024
Optimizing generalized kernels of polygons
Alejandra Martinez-Moraian, David Orden, Leonidas Palios +2
Let be a set of orientations in the plane, and let be a simple polygon in the plane. Given two points inside , we say that -\emph{se…