19 citations · 19 across the 5 of their papers we have counts for
5 papers
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…
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…