In mathematics, the Gabriel graph of a set S of points in the Euclidean plane expresses one notion of proximity or nearness of those points. Formally, it is the graph with vertex set S in which any points P and Q are adjacent precisely if they are distinct and the closed disc of which line segment PQ is a diameter contains no other elements of S. Gabriel graphs naturally generalize to higher dimensions, with the empty disks replaced by empty closed balls. Gabriel graphs are named after K. R. Gabriel, who introduced them in a paper with R. R. Sokal in 1969.
A finite site percolation threshold for Gabriel graphs has been proven to exist by Bertin, Billiot & Drouilhet (2002), and more precise values of both site and bond thresholds have been given by Norrenbrock (2014).
Related geometric graphs
It is an instance of a beta-skeleton. Like beta-skeletons, and unlike Delaunay triangulations, it is not a geometric spanner: for some point sets, distances within the Gabriel graph can be much larger than the Euclidean distances between points (Bose et al. 2006).
- Bertin, Etienne; Billiot, Jean-Michel; Drouilhet, Rémy (2002), "Continuum percolation in the Gabriel graph", Advances in Applied Probability, 34 (4): 689–701, doi:10.1239/aap/1037990948, MR 1938937.
- Bose, Prosenjit; Devroye, Luc; Evans, William; Kirkpatrick, David (2006), "On the spanning ratio of Gabriel graphs and β-skeletons", SIAM Journal on Discrete Mathematics, 20 (2): 412–427, doi:10.1137/S0895480197318088, MR 2257270.
- Gabriel, K. R.; Sokal, R. R. (1969), "A new statistical approach to geographic variation analysis", Systematic Zoology, Society of Systematic Biologists, 18 (3): 259–270, doi:10.2307/2412323, JSTOR 2412323.
- Matula, D. W.; Sokal, R. R. (1980), "Properties of Gabriel graphs relevant to geographic variation research and clustering of points in the plane", Geogr. Anal., 12 (3): 205–222, doi:10.1111/j.1538-4632.1980.tb00031.x.
- Norrenbrock, Christoph (2014), Percolation threshold on planar Euclidean Gabriel Graphs, arXiv:.