Short trees in polygons

DOI10.1016/S0166-218X(01)00256-6MaRDI QIDQ1348253zbMATH OpenOpenAlexFDO

Authors V. Pereyra, Pawel Winter, Martin Zachariasen, Jens Nielsen

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)

Recommendations

• Shortest trees and Steiner trees with rectilinear distances
• The Steiner tree problem for terminals on the boundary of a rectilinear polygon
• Computing Euclidean maximum spanning trees
• scientific article; zbMATH DE number 1163707
• scientific article; zbMATH DE number 1003287

Cites work

• A heuristic for Euclidean and rectilinear Steiner problems
• A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
• An Approximation Scheme for Finding Steiner Trees with Obstacles
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
• Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
• scientific article; zbMATH DE number 1163724 (Why is no real title available?)
• scientific article; zbMATH DE number 1368469 (Why is no real title available?)
• scientific article; zbMATH DE number 1424547 (Why is no real title available?)
• Local search for the Steiner tree problem in the Euclidean plane
• The Steiner tree problem

Cited in

(6)

• On the restricted 1-Steiner tree problem
• On the restricted k-Steiner tree problem
• Computing Euclidean Steiner trees over segments
• The geometry of inner spanning trees for planar polygons
• Maximising the worth of nascent networks
• Connect-the-dots: A new heuristic

Describes a project that uses

Uses Software

• LEDA

This page was built for publication: Short trees in polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348253)