Pablo Pérez-Lantero

collaborators

3 papers

cs.CG2019

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 $R$ and $B$ with $∣ R ∣ = ∣ B ∣$ , the perfect matching that matches points of $R$ with points of $B$ , and ma…

math.CO2019

On weighted sums of numbers of convex polygons in point sets

Clemens Huemer, Deborah Oliveros, Pablo Pérez-Lantero +2

Let $S$ be a set of $n$ points in general position in the plane, and let $X_{k, ℓ} (S)$ be the number of convex $k$ -gons with vertices in $S$ that have exactly $ℓ$ points of $S…

cs.CG2018

On the intersection graph of the disks with diameters the sides of a convex $n$ -gon

Luis H. Herrera, Pablo Pérez-Lantero

Given a convex $n$ -gon, we can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The in…

On Maximum-Sum Matchings of Points

On weighted sums of numbers of convex polygons in point sets

On the intersection graph of the disks with diameters the sides of a convex n-gon

On the intersection graph of the disks with diameters the sides of a convex $n$ -gon