Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs

DOI10.1016/0166-218X(93)90092-3zbMath0789.68115MaRDI QIDQ1315998

Pawel Winter

Publication date: 17 March 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmsEuclidean Steiner tree problemSteiner visibility graphs

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Maximising the worth of nascent networks ⋮ Short trees in polygons ⋮ On the restricted 1-Steiner tree problem ⋮ On the restricted \(k\)-Steiner tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• A linear time algorithm for full Steiner trees
• Triangulating a simple polygon in linear time
• Steiner minimal trees for three points with one convex polygonal obstacle
• A heuristic for Euclidean and rectilinear Steiner problems
• On the Problem of Steiner
• An Improved Algorithm for Steiner Trees
• An algorithm for the steiner problem in the euclidean plane
• Steiner problem in networks: A survey
• Visibility graphs and obstacle-avoiding shortest paths
• An Approximation Scheme for Finding Steiner Trees with Obstacles
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• The shortest network under a given topology
• Steiner Minimal Trees
• Steiner tree problems