Resumen de On Crossings in Geometric Proximity Graphs

Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández Merchant, David Flores Peñaloza, Ferran Hurtado Díaz, Vera Sacristán Adinolfi, María Saumell Mendiola

• We study the number of crossings among edges of some higher order proximity graphs of the family of the Delaunay graph. That is, given a set P of n points in the Euclidean plane, we give lower and upper bounds on the minimum and the maximum number of crossings that these geometric graphs defined on P have.