Steiner minimal trees for regular polygons
From MaRDI portal
Publication:1085166
DOI10.1007/BF02187871zbMATH Open0607.05022OpenAlexW2090486508MaRDI QIDQ1085166FDOQ1085166
Publication date: 1987
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131010
Recommendations
Cites Work
- Fuzzy sets
- On the Problem of Steiner
- The Complexity of Computing Steiner Minimal Trees
- A class of full Steiner minimal trees
- Steiner Minimal Trees on Zig-Zag Lines
- Steiner Minimal Tree for Points on a Circle
- Steiner Trees for Ladders
- Steiner minimal trees for bar waves
- A New Bound for the Steiner Ratio
- Title not available (Why is that?)
- Hexagonal coordinate systems and Steiner minimal trees
Cited In (41)
- Minimal Networks: A Review
- Sparse hop spanners for unit disk graphs
- Title not available (Why is that?)
- Steiner minimal trees on sets of four points
- Calibrations for minimal networks in a covering space setting
- Minimum Steiner trees on a set of concyclic points and their center
- On the Enumeration of Steiner-Tree Topologies for the Points on a Circle
- On the history of the Euclidean Steiner tree problem
- Extremal networks in $ \lambda$-geometry, where $ \lambda=3,4,6$
- Steiner minimal trees on regular polygons with centre
- Steiner minimal trees for bar waves
- Steiner Minimal Trees on Chinese Checkerboards
- Title not available (Why is that?)
- Steiner minimal trees in rectilinear and octilinear planes
- Steiner minimal trees with one polygonal obstacle.
- Immersed polygons and their diagonal triangulations
- Title not available (Why is that?)
- Minimal networks on the regular \(n\)-dimensional simplex
- Title not available (Why is that?)
- Hexagonal coordinate systems and Steiner minimal trees
- Symmetrization theorem of full Steiner trees
- Geometry and topology of local minimal 2-trees
- Planar Manhattan local minimal and critical networks
- Steiner polygons in the Steiner problem
- How to find Steiner minimal trees in Euclidean \(d\)-space
- A primer of the Euclidean Steiner problem
- Efficiently solvable special cases of hard combinatorial optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Determining shortest networks in the Euclidean plane
- Steiner minimal trees for zigzag lines with ladders
- Cut and patch Steiner trees for ladders
- Minimal Steiner trees for rectangular arrays of lattice points
- The Steiner minimal network for convex configurations
- Uniqueness of Steiner minimal trees on boundaries in general position
- A Ginzburg-Landau model with topologically induced free discontinuities
- Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices
- GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM
- Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds
- A PTAS for the Steiner Forest Problem in Doubling Metrics
- Steiner Minimal Tree for Points on a Circle
This page was built for publication: Steiner minimal trees for regular polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085166)
