The Steiner tree problem for terminals o
β
Siu-Wing Cheng
π
Article
π
2000
π
Elsevier Science
π
English
β 233 KB
Given a simple rectilinear polygon P with k sides and n terminals on its boundary, we present an O(k 3 n)-time algorithm to compute the minimal rectilinear Steiner tree lying inside P interconnecting the terminals. We obtain our result by proving structural properties of a selective set of minimal S