Pages that link to "Item:Q6487979"

The following pages link to A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets (Q6487979):

Displaying 4 items.

• A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
• The Steiner tree problem for terminals on the boundary of a rectilinear polygon (Q1566725) (← links)
• Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle (Q3487159) (← links)
• A rectilinear steiner minimal tree algorithm for convex point sets (Q5056104) (← links)