HURTADO DÍAZ , Ferran

Three different concepts of depth in a point set are considered and compared: Convex depth, location depth and Delaunay depth. As a notion of weight is naturally associated to each depth definition, we also present results on minimum weight structures (like spanning trees, poligonizations and triangulations) with respect to the three variations.

Dirección General de Educación Superior (Ministerio de Ciencia y Tecnología)

Let S be a two-colored set of n points in general position in the plane. We show that S admits at least 2 n 17 pairwise disjoint monochromatic triangles with vertices in S and empty of points of S. We further show that S can be partitioned into 3 n 11 subsets with pairwise disjoint convex hull such that within each subset all but at...

Let S be a set of n points in Rd in general position. A set H of k-flats is called an mk-stabber of S if the relative interior of any m-simplex with vertices in S is intersected by at least one element of H. In this paper we give lower and upper bounds on the size of minimum mk-stabbers of point sets in Rd. We study mainly mk-stabbers in the...

Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted versions have been proposed. We introduce a generalization, witness-bar visibility graphs, and we prove that this class...

It is well known that, given n red points and n blue points on a circle, it is not always possible to find a plane geometric Hamiltonian alternating path. In this work we prove that if we relax the constraint on the path from being plane to being 1-plane, then the problem always has a solution, and even a Hamiltonian alternating cycle can be...