Some Analytics for Steiner Minimal Tree Problem for Four Terminals
نویسنده
چکیده
Problem. Given set of points P = {Pj}j=1 in the Euclidean plane, find a system of line segments such that their union forms a connected set U containing P, and such that the total length of the line segments is minimized. This problem of construction the shortest possible network interconnecting the points of the set P is known as the (Euclidean) Steiner minimal tree problem (SMT problem). The stated problem in its particular case of n = 3 noncollinear points is known since 1643 as (classical) Fermat-Torricelli problem. It has a unique solution which
منابع مشابه
Steiner Minimal Trees in Simple Polygons
An O(n log n) time and O(n) space algorithm for the Euclidean Steiner tree problem with four terminals in a simple polygon with n vertices is given. Its applicability to the problem of determining good quality solutions for any number of terminals is discussed.
متن کاملSteiner Minimal Trees ∗
While a spanning tree spans all vertices of a given graph, a Steiner tree spans a given subset of vertices. In the Steiner minimal tree problem, the vertices are divided into two parts: terminals and nonterminal vertices. The terminals are the given vertices which must be included in the solution. The cost of a Steiner tree is defined as the total edge weight. A Steiner tree may contain some no...
متن کاملThe Steiner tree problem for terminals on the boundary of a rectilinear polygon
Given a simple rectilinear polygon P with k sides and n terminals on its boundary, we present an O(k 3 n)-time algorithm to compute the minimal rectilinear Steiner tree lying inside P interconnecting the terminals. We obtain our result by proving structural properties of a selective set of minimal Steiner trees and exploiting them in a dynamic programming algorithm.
متن کاملAn Exact Rectilinear Steiner Tree Algorithm
Given a set of terminals in the plane, a rectilin-ear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and vertical edges. We present an algorithm that constructs a rectilinear Steiner minimal tree for an input terminal set. On a workstation, problems involving 20 input terminals can be solved in a few seconds, and problems involving 30 input termin...
متن کاملShort trees in polygons
We consider the problem of determining the shortest Euclidean tree for terminals in a simple polygon. We give a fast polynomial heuristic based on greedy concatenation of Euclidean Steiner minimal trees with up to four terminals. Computational results indicate that the solutions obtained are close to optimal solutions. Another important contribution of the paper are linear time algorithms for o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1505.03564 شماره
صفحات -
تاریخ انتشار 2015