Premium
Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I
Author(s) -
Prendergast K.,
Thomas D.A.,
Weng J.F.
Publication year - 2009
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20285
Subject(s) - equilateral triangle , combinatorics , mathematics , constraint (computer aided design) , enhanced data rates for gsm evolution , space (punctuation) , plane (geometry) , geometry , computer science , telecommunications , operating system
Abstract It is well known that when there is no gradient constraint, the minimum Steiner ratio for three terminals is achieved with an equilateral triangle, and the ratio is $\sqrt{3} \over 2$ . This article shows that in the gradient‐constrained cases, the configuration of three terminals giving the minimum Steiner ratio is also an equilateral triangle. However, there are an infinite number of such triangles with differing orientations in 3‐space. We determine the behavior of the Steiner ratio over all of these equilateral triangles and thereby show that the minimum ratio occurs when the triangle is in the vertical plane with one edge vertical. The minimum ratio tends to $3 \over 4$ as the value of the gradient constraint tends to zero. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009