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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 11 January 2010.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Joseph L. Ganley, "rectilinear Steiner tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 11 January 2010. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/rectilinearSteinertree.html