Computation of minimal length full Steiner trees on the vertices of a convex polygon

Abstract

A Steiner minimal tree is a tree of minimal length whose vertices are a given set of points a 1 , ⋯ , a n {a_1}, \cdots ,{a_n} in E 2 {E^2} and any set of additional points s 1 , ⋯ , s k ( k ≧ 0 ) {s_1}, \cdots ,{s_k}(k \geqq 0) . In general, the introduction of extra points makes possible shorter trees than the minimal length tree whose vertices are precisely a 1 , ⋯ , a n {a_1}, \cdots ,{a_n} and for which practical algorithms are known. A Steiner minimal tree is the union of special subtrees, known as full Steiner trees. This paper demonstrates the use of the computer in generating minimal length full Steiner trees on sets of points in E 2 {E_2} which are the vertices of convex polygons. The procedure given is a basis from which further research might proceed towards an ultimate practical algorithm for the construction of Steiner minimal trees.