65 citations · 86 across the 9 of their papers we have counts for
10 papers
Catenary Visibility: A Geometric Framework for Planning with Tethered Robots
B. Ábrego, J. M. Díaz-Báñez, S. Fernández +2
This paper introduces \emph{catenary visibility}, a new geometric visibility concept for a robotic system consisting of a ground robot tethered to an aerial drone. The tether is mo…
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
David Flores-Peñaloza, Mario A. Lopez, Nestaly Marín +1
Let be a -colored set of points in the plane, . We study the problem of deciding if contains a subset of four points of different colors such that i…
On polynomials associated to Voronoi diagrams of point sets and crossing numbers
Mercè Claverol, Andrea de las Heras-Parrilla, David Flores-Peñaloza +2
Three polynomials are defined for given sets of points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order- V…
Rainbow polygons for colored point sets in the plane
David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval +5
Given a colored point set in the plane, a perfect rainbow polygon is a simple polygon that contains exactly one point of each color, either in its interior or on its boundary. Let…
On Maximum-Sum Matchings of Points
Sergey Bereg, Oscar Chacón-Rivera, David Flores-Peñaloza +3
Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets and with , the perfect matching that matches points of with points of , and ma…
Balanced Islands in Two Colored Point Sets in the Plane
Oswin Aichholzer, Nieves Atienza, Ruy Fabila-Monroy +5
Let be a set of points in general position in the plane, of which are red and of which are blue. In this paper we prove that there exist: for every $α\in \left [ 0,…
Modem Illumination of Monotone Polygons
Oswin Aichholzer, Ruy Fabila-Monroy, David Flores-Peñaloza +3
We study a generalization of the classical problem of the illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a…
Drawing the double circle on a grid of minimum size
Sergey Bereg, Ruy Fabila-Monroy, David Flores-Peñaloza +2
In 1926, Jarník introduced the problem of drawing a convex -gon with vertices having integer coordinates. He constructed such a drawing in the grid for so…
On the Connectedness and Diameter of a Geometric Johnson Graph
Crevel Bautista-Santiago, Javier Cano, Ruy Fabila-Monroy +5
Let be a set of points in general position in the plane. A subset of is called an \emph{island} if there exists a convex set such that . In this p…
Token Graphs
Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer +3
For a graph and integer , we define the token graph to be the graph with vertex set all -subsets of , where two vertices are adjacent in when…