H. González-Aguilar

activity

20122019

most citedOn

k

-Gons and

k

-Holes in Point Sets

3 citations · 5 across the 4 of their papers we have counts for

collaborators

Showing cs.CGShow 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 $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.CG2012

Large convex holes in random point sets

József Balogh, Hernán González-Aguilar, Gelasio Salazar

A {\em convex hole} (or {\em empty convex polygon)} of a point set $P$ in the plane is a convex polygon with vertices in $P$ , containing no points of $P$ in its interior. Let $R$ b…