Short trees in polygons

DOI10.1016/S0166-218X(01)00256-6zbMath1004.68182OpenAlexW2089362834MaRDI QIDQ1348253

V. Pereyra

Publication date: 15 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00256-6

zbMATH Keywords

Euclidean treeobstacle-avoiding Steiner trees

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Maximising the worth of nascent networks ⋮ Computing Euclidean Steiner trees over segments ⋮ On the restricted 1-Steiner tree problem ⋮ On the restricted \(k\)-Steiner tree problem

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic for Euclidean and rectilinear Steiner problems
• The Steiner tree problem
• Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
• A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
• Local search for the Steiner tree problem in the Euclidean plane
• Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
• An Approximation Scheme for Finding Steiner Trees with Obstacles
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric

This page was built for publication: Short trees in polygons