Euclidean minimum spanning tree: Difference between revisions

Revision as of 17:50, 29 August 2022

Revision as of 17:53, 29 August 2022

Line 32:

===Supergraphs===

Certain [[geometric graph]]s definedhave usingdefinitions involving empty regions in point sets, from which it follows that they contain every edge that can be part of a Euclidean minimum spanning tree. 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.