In mathematics and computational geometry, the Gabriel graph of a set S {\displaystyle S} of points in the Euclidean plane expresses one notion of proximity or nearness of those points. Formally, it is the graph G {\displaystyle G} with vertex set S {\displaystyle S} in which any two distinct points p ∈ S {\displaystyle p\in S} and q ∈ S {\displaystyle q\in S} are adjacent precisely when the closed disc having p q {\displaystyle pq} as a diameter contains no other points.
In mathematics and computational geometry, the Gabriel graph of a set S {\displaystyle S} of points in the Euclidean plane expresses one notion of proximity or nearness of those points. Formally, it is the graph G {\displaystyle G} with vertex set S {\displaystyle S} in which any two distinct points p ∈ S {\displaystyle p\in S} and q ∈ S {\displaystyle q\in S} are adjacent precisely when the closed disc having p q {\displaystyle pq} as a diameter contains no other points.
Source: Wikipedia "Gabriel graph" · CC BY-SA 4.0
Share this article: X · Bluesky