Abstract
Ak-extremal point set is a point set on the boundary of ak-sided rectilinear convex hull. Given ak-extremal point set of sizen, we present an algorithm that computes a rectilinear Steiner minimal tree in timeO(k 4 n). For constantk, this algorithm runs inO(n) time and is asymptotically optimal and, for arbitraryk, the algorithm is the fastest known for this problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. K. Agarwal and M.-T. Shing, Algorithms for Special Cases of Rectilinear Steiner Trees: I. Points on the Boundary of a Rectilinear Rectangle,Networks,20 (1990), 453–485.
A. V. Aho, M. R. Garey, and F. K. Hwang, Rectilinear Steiner Trees: Efficient Special-Case Algorithms,Networks,7 (1977), 37–58.
M. Bern, Faster Exact Algorithms for Steiner Trees in Planar Networks,Networks,20 (1990), 109–120.
J. P. Cohoon, D. S. Richards, and J. S. Salowe, An Optimal Steiner Tree Algorithm for a Net Whose Terminals Lie on the Perimeter of a Rectangle,IEEE Trans. Computer-Aided Design Integrated Circuits and Systems,9 (1990), 398–407.
H. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and Related Techniques for Geometry Problems,Proc. 16th Symposium on the Theory of Computing, 1984, pp. 135–143.
M. R. Garey and D. S. Johnson,Computers and Intractability, Freeman, San Francisco, 1979.
M. Hanan, On Steiner's Problem with Rectilinear Distance,SIAM J. Appl. Math.,14 (1966), 255–265.
F. K. Hwang, On Steiner Minimal Trees with Rectilinear Distance,SIAM J. Appl. Math.,30 (1976), 104–114.
F. K. Hwang and D. S. Richards, Steiner Tree Problems,Networks (to appear).
E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976.
T. M. Nicholl, D. T. Lee, Y. Z. Liao, and C. K. Wong, On theX-Y Convex Hull of a Set ofX-Y Points,BIT,23 (1983), 456–471.
J. S. Provan, Convexity and the Steiner Tree Problem,Networks,18 (1988), 55–72.
D. S. Richards and J. S. Salowe, Special Convex Cases for Rectilinear Steiner Minimal Trees,Proc. NATO Workshop on Topological Network Design, 1989.
Y. Y. Yang and O. Wing, Optimal and Suboptimal Solution Algorithms for the Wiring Problem,Proc. IEEE International Symposium on Circuit Theory, 1972, pp. 154–158.
Author information
Authors and Affiliations
Additional information
Communicated by F. K. Hwang.
Rights and permissions
About this article
Cite this article
Richards, D.S., Salowe, J.S. A linear-time algorithm to construct a rectilinear Steiner minimal tree fork-extremal point sets. Algorithmica 7, 247–276 (1992). https://doi.org/10.1007/BF01758761
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01758761