An O(n log n) algorithm for suboptimal rectilinear Steiner trees

We propose a suboptimal rectilinear Steiner tree algorithm which can be constructed in
O(n \log n)
time, and has good average-case and worst case performance.