Sciweavers

Share
COMGEO
2011
ACM

On crossing numbers of geometric proximity graphs

8 years 1 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, namely, the k-nearest neighbor graph, the k-relative neighborhood graph, the k-Gabriel graph and the k-Delaunay graph. For k = 0 (k = 1 in the case of the k-nearest neighbor graph) these graphs are plane, but for higher values of k in general they contain crossings. In this paper we provide lower and upper bounds on their minimum and maximum number of crossings. We give general bounds and we also study particular cases that are especially interesting from the viewpoint of applications. These cases include the 1-Delaunay graph and the k-nearest neighbor graph for small values of k. Keywords Proximity graphs; geometric graphs; crossing number.
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2011
Where COMGEO
Authors Bernardo M. Ábrego, Ruy Fabila Monroy, Silvia Fernández-Merchant, David Flores-Peñaloza, Ferran Hurtado, Vera Sacristan, Maria Saumell
Comments (0)
books