Euclidean minimum spanning tree: Difference between revisions

Revision as of 15:34, 28 August 2022

Revision as of 17:50, 29 August 2022

Line 32:

===Supergraphs===

Certain [[geometric graph]]s defined using empty regions in point sets must contain allevery edge that can be edgespart of alla Euclidean minimum spanning treestree. 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.