Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On Crossings in Geometric Proximity Graphs Bernardo M. Abrego
 

Summary: On Crossings in Geometric Proximity Graphs
Bernardo M. ŽAbrego
Ruy Fabila-Monroy
Silvia FernŽandez-Merchant
David Flores-Pe~naloza
Ferran Hurtado
Vera SacristŽan
Maria Saumell
Abstract
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.
1 Introduction
Let P be a set of n points in the plane in general position (no three are collinear). A geometric graph
on P is a graph with vertex set P and such that its edges are drawn as straight-line segments. When
two edges share an interior point we say that they give rise to a crossing.
The number of crossings is a parameter that has been attracting extensive studies in the context of
combinatorial graphs. Given a graph G, the crossing number of G, denoted by cr(G), is the minimum
number of crossings in any drawing of G, i.e., in any non-degenerate representation of the graph in the

  

Source: Abrego, Bernardo - Department of Mathematics, California State University, Northridge
Fernandez, Silvia - Department of Mathematics, California State University, Northridge

 

Collections: Mathematics