Pages that link to "Item:Q5056104"
From MaRDI portal
The following pages link to A rectilinear steiner minimal tree algorithm for convex point sets (Q5056104):
Displaying 6 items.
- A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
- Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
- Computing Steiner points for gradient-constrained minimum networks (Q1952503) (← links)
- Narrow-Shallow-Low-Light Trees with and without Steiner Points (Q5894321) (← links)
- Minimum Steiner trees on a set of concyclic points and their center (Q6071053) (← links)
- A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets (Q6487979) (← links)