Gabriel graph
id:
gabriel-graph-197-7088856
title:
Gabriel graph
text:
In mathematics and computational geometry, 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 G with vertex set S in which any two distinct points p ∈ S and q ∈ S are adjacent precisely when the closed disc having p q as a diameter contains no other points. Another way of expressing the same adjacency criterion is that p and q should be the two closest given points to their midpoint, with no other
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Gabriel_graph
date created:
date modified:
2023-06-10T01:32:51Z
main entity:
{"identifier":"Q2783524","url":"https://www.wikidata.org/entity/Q2783524"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/32/Gabriel_Pairs.svg","width":180,"height":196}
fields total:
13
integrity:
14