 Euclidean minimum spanning tree

The Euclidean Minimum Spanning Tree (EMST) is a specific type of minimum spanning tree where the vertices of the graph correspond to points in a Euclidean space, and the edges represent the straight-line (Euclidean) distances between these points.