Euclidean minimum spanning tree: Difference between revisions

Revision as of 02:12, 28 August 2022

Revision as of 02:50, 28 August 2022

Line 33:

===Supergraphs===

Certain [[geometric graph]]s defined fromusing pointsempty andregions theirin emptypoint regionssets must contain all edges of all Euclidean minimum spanning trees. These include:

*The [[relative neighborhood graph]], which has an edge between any pair of points whenever the lens they define is empty.

*The [[Gabriel graph]], which has an edge between any pair of points whenever the circle having the pair as a diameter is empty.