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 in S 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.
The Gabriel graph is a subgraph of the Delaunay triangulation; it can be found in linear time if the Delaunay triangulation is given (Matula and Sokal, 1980). The Gabriel graph contains as a subgraph the Euclidean minimum spanning tree, the relative neighborhood graph, and the nearest neighbor graph. It is an instance of a beta-skeleton.
A finite site percolation threshold for Gabriel graphs has been proven to exist by E. Bertin, J.-M. Billiot, and R. Drouilhet, and more precise values of both site and bond thresholds have been given by C. Norrenbrock.
- 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.
- Bertin, E; J.-M. Billiot, R. Drouilhet (2002). "Continuum percolation in the Gabriel graph". Adv. Appl. Prob. 34: 689.
- Norrenbrock, C. (2014). "Percolation threshold on planar Euclidean Gabriel Graphs". preprint. arXiv:0704.2098..
|This geometry-related article is a stub. You can help Wikipedia by expanding it.|