Euclidean minimum spanning tree
The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of n points in the plane (or more generally in ℝd), where the weight of the edge between each pair of points is the Euclidean distance between those two points. In simpler terms, an EMST connects a set of dots using lines such that the total length of all the lines is minimized and any dot can be reached from any other by following the lines. In higher dimensions (d ≥ 3), finding an optimal algorithm remains an open problem.
Wikipage disambiguates
primaryTopic
Euclidean minimum spanning tree
The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of n points in the plane (or more generally in ℝd), where the weight of the edge between each pair of points is the Euclidean distance between those two points. In simpler terms, an EMST connects a set of dots using lines such that the total length of all the lines is minimized and any dot can be reached from any other by following the lines. In higher dimensions (d ≥ 3), finding an optimal algorithm remains an open problem.
has abstract
The Euclidean minimum spanning ...... rithm remains an open problem.
@en
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
680,080,033
comment
The Euclidean minimum spanning ...... rithm remains an open problem.
@en
label
Euclidean minimum spanning tree
@en