(definition)
Definition: A minimum-length rectilinear tree 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, Euclidean Steiner tree.
Author: JLG
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 11 January 2010.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Joseph L. Ganley, "rectilinear Steiner tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 11 January 2010. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/rectilinearSteinertree.html
