65 citations · 231 across the 29 of their papers we have counts for
30 papers
Crossing and intersecting families of geometric graphs on point sets
José Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín +2
Let be a set of points in the plane in general position. Two line segments connecting pairs of points of cross if they have an interior point in common. Two vertex disj…
Convex polygons and separation of convex sets
Eduardo Rivera-Campo, Jorge Urrutia
We prove that for any collection F of pairwise disjoint compact convex sets in the plane there is a pair of sets A and B in F such that any line that separates A from B s…
On Optimal Coverage of a Tree with Multiple Robots
I. Aldana-Galván, J. C. Catana-Salazar, J. M. Díaz-Báñez +5
We study the algorithmic problem of optimally covering a tree with mobile robots. The tree is known to all robots, and our goal is to assign a walk to each robot in such a way…
Rectilinear Convex Hull of Points in 3D
Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia
Let be a set of points in in general position, and let be the rectilinear convex hull of . In this paper we obtain an optimal -time a…
Separating bichromatic point sets in the plane by restricted orientation convex hulls
Carlos Alegría, David Orden, Carlos Seara +1
We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing s…
Minimizing Visible Edges in Polyhedra
Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta
We prove that, given a polyhedron in , every point in that does not see any vertex of must see eight or more edges of $\mathca…