92 citations · 590 across the 38 of their papers we have counts for
38 papers
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…
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…
On approximating shortest paths in weighted triangular tessellations
Prosenjit Bose, Guillermo Esteban, David Orden +1
We study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessel…
Geometric and statistical techniques for projective mapping of chocolate chip cookies with a large number of consumers
David Orden, Encarnación Fernández-Fernández, Marino Tejedor-Romero +1
The so-called rapid sensory methods have proved to be useful for the sensory study of foods by different types of panels, from trained assessors to unexperienced consumers. Data fr…
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility
Bengt J. Nilsson, David Orden, Leonidas Palios +2
We present an time algorithm for computing and maintaining a minimum length shortest watchman tour that sees a simple polygon under monotone visibility in direction , w…
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…