David Orden

collaborators

4 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

On approximating shortest paths in weighted triangular tessellations

Prosenjit Bose, Guillermo Esteban, David Orden +1

We study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessel…

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…

cs.CG2024

Optimizing generalized kernels of polygons

Alejandra Martinez-Moraian, David Orden, Leonidas Palios +2

Let $O$ be a set of $k$ orientations in the plane, and let $P$ be a simple polygon in the plane. Given two points $p, q$ inside $P$ , we say that $p$ $O$ -\emph{se…