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

5 papers

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)…

math.CO2017

The complexity of computing the cylindrical and the $t$ -circle crossing number of a graph

Frank Duque, Hernán González-Aguilar, César Hernández-Vélez +2

A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoint…

cs.DM2014★ 3 cited

On $k$ -Gons and $k$ -Holes in Point Sets

Oswin Aichholzer, Ruy Fabila-Monroy, Hernán González-Aguilar +6

We consider a variation of the classical Erdős-Szekeres problems on the existence and number of convex $k$ -gons and $k$ -holes (empty $k$ -gons) in a set of $n$ points in the plane.…

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…

math.CO2012

On the Connectedness and Diameter of a Geometric Johnson Graph

Crevel Bautista-Santiago, Javier Cano, Ruy Fabila-Monroy +5

Let $P$ be a set of $n$ points in general position in the plane. A subset $I$ of $P$ is called an \emph{island} if there exists a convex set $C$ such that $I = P \cap C$ . In this p…