Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\) (Q1941216): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:18, 5 March 2024

scientific article
Language Label Description Also known as
English
Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\)
scientific article

    Statements

    Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\) (English)
    0 references
    0 references
    0 references
    12 March 2013
    0 references
    The authors present some important results in the study of the topologies for Euclidean Steiner minimal trees in \(\mathbb R^d\). Also, some conditions for trees with a full Steiner topologies are described. The paper consists of five sections. In the first section, some important notions concerning the Steiner Euclidean tree problem are re-called. In the second section, called geometric conditions for Euclidean Steiner minimal trees, the authors use in the proofs of some lemmas and theorems, the link between Voronoi diagrams, Delaunay triangulations and Euclidean Steiner trees. In the third section, some conditions for a Steiner minimal tree with a full Steiner topology are presented. In Section 4, some implementations of Smith's algorithm are presented for solving the Euclidean tree problem in \(\mathbb R^d\). In the last section, there are presented some conclusions and future works. The bibliography contains 12 titles, some of them very recent. In conclusion, the paper is well written and presents some important results at the border of computational geometry, graph theory and topology.
    0 references
    Voronoi diagram
    0 references
    Delaunay triangulation
    0 references
    Euclidean Steiner minimal trees
    0 references
    Steiner topology
    0 references
    Smith's algorithm
    0 references

    Identifiers