On the Steiner Ratio in 3-Space

نویسندگان

  • Warren D. Smith
  • James MacGregor Smith
چکیده

| The \Steiner minimal tree" (SMT) of a point set P is the shortest network of \wires" which will suuce to \electrically" interconnect P. The \minimum spanning tree" (MST) is the shortest such network when only intersite line segments are permitted. The \Steiner ratio" (P) of a point set P is the length of its SMT divided by the length of its MST. It is of interest to understand which point set (or point sets) in R d have minimal Steiner ratio. In this paper , we introduce a point set in R d which we call the \d-dimensional sausage." The 1 and 2-dimensional sausages have minimal Steiner ratios 1 and p 3=2 respectively. (The 2-sausage is the vertex set of an innnite strip of abutting equilateral triangles. The 3-sausage is an innnite number of points evenly spaced along a certain helix.) We present extensive heuristic evidence to support the conjecture that the 3-sausage also has minimal Steiner ratio (0:784190373377122). Also: We prove that the regular tetrahedron minimizes among 4-point sets to at least 12 decimal places of accuracy. This is a companion paper to D-Z. Du and W.D.Smith: Three disproofs of the Gilbert-Pollak Steiner ratio conjecture in three or more dimensions, submitted Journal of Combinatorial Theory. We have tried to devote this paper more to 3D and the other paper more to general dimension, but the split is not clean.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Tight Lower Bound for the Steiner Ratio in

A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of points in the ,metric space. In this note, we show that for any Minkowski plane, the Steiner rat...

متن کامل

Rotational Steiner Ratio Problem Under Uniform Orientation Metrics

Let P be a set of n points in a metric space. A Steiner Minimal Tree (SMT) on P is a shortest network interconnecting P while a Minimum Spanning Tree (MST) is a shortest network interconnecting P with all edges between points of P . The Steiner ratio is the infimum over P of ratio of the length of SMT over that of MST. Steiner ratio problem is to determine the value of the ratio. In this paper ...

متن کامل

The Steiner ratio for the dual normed plane

A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimal possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of points in the metric space. Du et al. (1993) conjectured that the Steiner ratio on a normed plan...

متن کامل

Approximating Steiner Trees and Forests with Minimum Number of Steiner Points

Let R be a finite set of terminals in a metric space (M,d). We consider finding a minimum size set S ⊆ M of additional points such that the unit-disc graph G[R ∪ S] of R ∪ S satisfies some connectivity properties. In the Steiner Tree with Minimum Number of Steiner Points (ST-MSP) problem G[R ∪ S] should be connected. In the more general Steiner Forest with Minimum Number of Steiner Points (SF-M...

متن کامل

On stars and Steiner stars: II

A Steiner star for a set P of n points in R connects an arbitrary center point to all points of P , while a star connects a point p ∈ P to the remaining n−1 points of P . All connections are realized by straight line segments. Fekete and Meijer showed that the minimum star is at most √ 2 times longer than the minimum Steiner star for any finite point configuration in R. The maximum ratio betwee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 69  شماره 

صفحات  -

تاریخ انتشار 1995