Steiner minimal trees for regular polygons
From MaRDI portal
A Steiner minimal tree for a set of points P in the plane is a shortest network interconnecting P. This paper shows that for the vertices of a regular n-gon, \(7\leq n\leq 12\), the Steiner minimal tree consists of the perimeter of the regular n-gon minus one side (this result had previously been proved for \(n\geq 13)\). It is also shown that the set of n equally spaced points yields the longest Steiner minimal tree among all sets of n cocircular points on a given circle.
Recommendations
Cites work
- A class of full Steiner minimal trees
- A New Bound for the Steiner Ratio
- Fuzzy sets
- Hexagonal coordinate systems and Steiner minimal trees
- scientific article; zbMATH DE number 3912403 (Why is no real title available?)
- On the Problem of Steiner
- Steiner Minimal Tree for Points on a Circle
- Steiner minimal trees for bar waves
- Steiner Minimal Trees on Zig-Zag Lines
- Steiner Trees for Ladders
- The Complexity of Computing Steiner Minimal Trees
Cited in
(48)- Hexagonal coordinate systems and Steiner minimal trees
- Steiner minimal trees on sets of four points
- Some upper bounds for minimal trees
- A primer of the Euclidean Steiner problem
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Steiner minimal trees for a class of zigzag lines
- The Steiner minimal network for convex configurations
- Symmetrization theorem of full Steiner trees
- Steiner polygons in the Steiner problem
- Cut and patch Steiner trees for ladders
- Minimal Steiner trees for rectangular arrays of lattice points
- Efficiently solvable special cases of hard combinatorial optimization problems
- Planar Manhattan local minimal and critical networks
- Steiner minimal trees on regular polygons with centre
- Minimal Steiner trees for 2^ k 2^ k square lattices
- Minimal trees for regular polygons: Linear parquets realization
- A Ginzburg-Landau model with topologically induced free discontinuities
- On the history of the Euclidean Steiner tree problem
- Steiner minimal trees in rectilinear and octilinear planes
- Minimal networks: a review
- scientific article; zbMATH DE number 5834213 (Why is no real title available?)
- scientific article; zbMATH DE number 440765 (Why is no real title available?)
- Uniqueness of Steiner minimal trees on boundaries in general position
- Immersed polygons and their diagonal triangulations
- scientific article; zbMATH DE number 3922677 (Why is no real title available?)
- Steiner Minimal Tree for Points on a Circle
- scientific article; zbMATH DE number 8006 (Why is no real title available?)
- Steiner Minimal Trees on Chinese Checkerboards
- scientific article; zbMATH DE number 1302189 (Why is no real title available?)
- Determining shortest networks in the Euclidean plane
- Geometry and topology of local minimal 2-trees
- Linear Steiner Trees for Infinite Spirals
- Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds
- On the Enumeration of Steiner-Tree Topologies for the Points on a Circle
- GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM
- Minimum perimeter developments of the Platonic solids
- Calibrations for minimal networks in a covering space setting
- Extremal networks in -geometry, where =3,4,6
- A PTAS for the Steiner forest problem in doubling metrics
- Steiner minimal trees for bar waves
- Steiner minimal trees for zigzag lines with ladders
- Steiner minimal trees with one polygonal obstacle.
- Minimal networks on the regular \(n\)-dimensional simplex
- scientific article; zbMATH DE number 7765415 (Why is no real title available?)
- Minimum Steiner trees on a set of concyclic points and their center
- Efficient algorithms for Euclidean Steiner minimal tree on near-convex terminal sets
- Steiner trees with infinitely many terminals on the sides of an angle
- Sparse hop spanners for unit disk graphs
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)
