Mutual witness proximity graphs

This paper describes one variation on witness proximity graphs called mutual witness proximity graphs. Two witness proximity graphs are said to be mutual when, given two sets of points A and B, A is the vertex set of the first graph and the witness set of the second one, while B is the witness set of the first graph and the vertex set of the second one. We show that in the union of two mutual witness Delaunay graphs, there are always at least @?n-22@? edges, where n=|A|+|B|, which is tight in the worst case. We also show that if two mutual witness Delaunay graphs are complete, then the sets A and B are circularly separable; if two mutual witness Gabriel graphs are complete, then the sets A and B are linearly separable; but two mutual witness rectangle graphs might be complete, with A and B not linearly separable.

[1]  Alexander Pilz,et al.  Blocking Delaunay triangulations , 2010, CCCG.

[2]  Giuseppe Liotta,et al.  Proximity Drawings , 2013, Handbook of Graph Drawing and Visualization.

[3]  Godfried T. Toussaint,et al.  Geometric Decision Rules for Instance-Based Learning Problems , 2005, PReMI.

[4]  Boris Aronov,et al.  Witness Gabriel graphs , 2010, Comput. Geom..

[5]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[6]  Boris Aronov,et al.  Witness (Delaunay) graphs , 2010, Comput. Geom..

[7]  Arthur Getis,et al.  Models of spatial processes : an approach to the study of point, line, and area patterns , 1979 .

[8]  B. Aronov,et al.  Witness proximity graphs and other geometric problems , 2012 .

[9]  Boris Aronov,et al.  Witness Rectangle Graphs , 2014, Graphs Comb..

[10]  Boris Aronov,et al.  Witness Rectangle Graphs , 2011, Graphs Comb..

[11]  Giuseppe Liotta,et al.  Proximity Drawability: a Survey , 1994, Graph Drawing.

[12]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[13]  Manabu Ichino,et al.  The relative neighborhood graph for mixed feature variables , 1985, Pattern Recognit..

[14]  修身 山本.  International Symposium on Voronoi Diagrams in Science and Engineering , 2005 .

[15]  W..  Relative Neighborhood Graphs and Their Relatives , 2004 .

[16]  Godfried T. Toussaint,et al.  Proximity Graphs for Nearest Neighbor Decision Rules: Recent Progress , 2002 .

[17]  Masud Hasan,et al.  Vindictive Voronoi Games and Stabbing Delaunay Circles , 2010, 2010 International Symposium on Voronoi Diagrams in Science and Engineering.