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.

[1]  Kyungsook Han,et al.  Computational Identification of Interaction Motifs in Hepatitis C Virus NS5A and Human Proteins , 2007, 2007 International Conference on Convergence Information Technology (ICCIT 2007).

[2]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[3]  Ruei-Chuan Chang,et al.  The K-Gabriel Graphs and Their Applications , 1990, SIGAL International Symposium on Algorithms.

[4]  Maher A. Sid-Ahmed,et al.  Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers , 2007 .

[5]  Joachim Gudmundsson,et al.  Higher order Delaunay triangulations , 2000, Comput. Geom..

[6]  E. Szemerédi,et al.  Crossing-Free Subgraphs , 1982 .

[7]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[8]  Ruei-Chuan Chang,et al.  Computing the k-relative neighborhood graphs in Euclidean plane , 1991, Pattern Recognit..

[9]  Jesús Leaños,et al.  3-symmetric and 3-decomposable geometric drawings of Kn , 2010, Discret. Appl. Math..

[10]  L. Moser,et al.  AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .

[11]  Joel H. Spencer,et al.  New Bounds on Crossing Numbers , 1999, SCG '99.

[12]  Godfried T. Toussaint,et al.  Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining , 2005, Int. J. Comput. Geom. Appl..

[13]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[14]  Ken-ichi Kawarabayashi,et al.  Improved upper bounds on the crossing number , 2008, SCG '08.

[15]  Prosenjit Bose,et al.  On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs , 2009, Int. J. Comput. Geom. Appl..

[16]  David G. Stork,et al.  Pattern Classification , 1973 .

[17]  Maarten Löffler,et al.  Optimization for first order Delaunay triangulations , 2007, Comput. Geom..

[18]  C. Zarankiewicz.  On a problem of P. Turan concerning graphs , 1955 .

[19]  János Pach,et al.  Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs , 2006, Discret. Comput. Geom..

[20]  J. Pach.  Towards a Theory of Geometric Graphs , 2004 .

[21]  Maarten Löffler,et al.  Optimization for First Order Delaunay Triangulations , 2007, WADS.

[22]  David R. Wood,et al.  Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor , 2006, GD.

[23]  János Pach,et al.  Graphs drawn with few crossings per edge , 1997, Comb..

[24]  F. Thomas Leighton,et al.  Complexity Issues in VLSI , 1983 .

[25]  Venu Govindaraju,et al.  Improved k-nearest neighbor classification , 2002, Pattern Recognit..

[26]  Michael Jünger,et al.  Graph Drawing Software , 2003, Graph Drawing Software.

[27]  Ivan Herman,et al.  Graph Visualization and Navigation in Information Visualization: A Survey , 2000, IEEE Trans. Vis. Comput. Graph..

[28]  Alexander Schrijver,et al.  Reduction of symmetric semidefinite programs using the regular $$\ast$$-representation , 2007, Math. Program..

[29]  János Pach,et al.  Research problems in discrete geometry , 2005 .

[30]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[31]  Godfried T. Toussaint,et al.  Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.

[32]  Jesús Leaños,et al.  A central approach to bound the number of crossings in a generalized configuration , 2008, Electron. Notes Discret. Math..