(definition)
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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 5 January 2009.
HTML page formatted Wed Feb 4 11:02:21 2009.
Cite this as:
Joseph L. Ganley, "Euclidean Steiner tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 5 January 2009. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/euclidSteinerTree.html
