Hexagonal coordinate systems and Steiner minimal trees

DOI10.1016/0012-365X(86)90040-3zbMath0601.05016MaRDI QIDQ1080858

B. George

Publication date: 1986

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

zbMATH Keywords

Steiner pointsSteiner minimal treeSteiner tree

Mathematics Subject Classification ID

Trees (05C05)

Related Items

Steiner minimal trees for regular polygons ⋮ Fast heuristic algorithms for rectilinear Steiner trees ⋮ Geometry and topology of local minimal 2-trees ⋮ A primer of the Euclidean Steiner problem ⋮ How to find Steiner minimal trees in Euclidean \(d\)-space ⋮ An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space ⋮ The Steiner problem on surfaces of revolution

Cites Work

• A linear time algorithm for full Steiner trees
• Steiner minimal trees for regular polygons
• On the Problem of Steiner
• Steiner Minimal Trees
• On the Efficiency of the Algorithm for Steiner Minimal Trees