On the location of Steiner points in uniformly-oriented Steiner trees
We give a fundamental result on the location of Steiner points for Steiner minimum trees in uniform orientation metrics. As a corollary we obtain a linear time algorithm for constructing a Steiner minimum tree for a given full topology when the number of uniform orientations is lambda = 3m, m greater than or equal to 1. (C) 2002 Elsevier Science B.V. All rights reserved.
steiner trees computational geometry interconnection networks