Pages that link to "Item:Q5943667"
From MaRDI portal
The following pages link to Steiner minimal trees with one polygonal obstacle. (Q5943667):
Displaying 4 items.
- Maximising the worth of nascent networks (Q301061) (← links)
- Steiner minimal trees for three points with one convex polygonal obstacle (Q1179763) (← links)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree (Q2816044) (← links)