Euclidean Steiner tree


Definition: A tree of minimum Euclidean distance connecting a set of points, called terminals, in the plane. This tree may include points other than the terminals, which are called Steiner points.

See also Steiner tree, rectilinear Steiner tree.

Author: JLG

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 11 January 2010.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Joseph L. Ganley, "Euclidean Steiner tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 11 January 2010. (accessed TODAY) Available from: