Pablo Pérez-Lantero

most citedAdaptive Techniques to find Optimal Planar Boxes

1 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2023

Center of maximum-sum matchings of bichromatic points

Pablo Pérez-Lantero, Carlos Seara

Let $R$ and $B$ be two disjoint point sets in the plane with $∣ R ∣ = ∣ B ∣ = n$ . Let $M = {(r_{i}, b_{i}), i = 1, 2, \dots, n}$ be a perfect matching that matches points of $R$ with point…

cs.CG2012

The 1-Center and 1-Highway problem

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +1

We study a variation of the 1-center problem in which, in addition to a single supply facility, we are allowed to locate a highway. This highway increases the transportation speed…

cs.CG2012

Locating a single facility and a high-speed line

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +1

In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimiz…

cs.CG2012★ 1 cited

Adaptive Techniques to find Optimal Planar Boxes

J. Barbay, G. Navarro, P. Pérez-Lantero

Given a set $P$ of $n$ planar points, two axes and a real-valued score function $f ()$ on subsets of $P$ , the Optimal Planar Box problem consists in finding a box (i.e. axis-aligned…

cs.CG2012★ 1 cited

On the number of radial orderings of planar point sets

José M. Díaz-Bañez, Ruy Fabila-Monroy, Pablo Pérez-Lantero

Given a set $S$ of $n$ points in the plane, a \emph{radial ordering} of $S$ with respect to a point $p$ (not in $S$ ) is a clockwise circular ordering of the elements in $S$ by angl…