✦ LIBER ✦

Improved computation of plane Steiner Minimal Trees

✍ Scribed by E. J. Cockayne; D. E. Hewgill

Publisher: Springer
Year: 1992
Tongue: English
Weight: 563 KB
Volume: 7
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01758759

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Steiner Minimal Trees in Rectilinear and

Steiner Minimal Trees in Rectilinear and Octilinear Planes

✍ Song Pu Shang; Tong Jing 📂 Article 📅 2007 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 299 KB

A class of full Steiner minimal trees

✍ F.K. Hwang; Jia Feng Weng; Ding Zhu Du 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 559 KB

Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using Eines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one).

Steiner minimal trees on sets of four po

Steiner minimal trees on sets of four points

✍ D. Z. Du; F. K. Hwang; G. D. Song; G. Y. Ting 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 571 KB

Minimal Steiner Trees for Rectangular Ar

Minimal Steiner Trees for Rectangular Arrays of Lattice Points

✍ M Brazil; J.H Rubinstein; D.A Thomas; J.F Weng; N.C Wormald 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 619 KB

We construct minimal Steiner trees for any square or rectangular array of integer lattice points on the Euclidean plane. 1997 Academic Press ## 1. INTRODUCTION AND PRELIMINARIES This paper answers a series of questions raised by Chung et al. in [3] on the length of the shortest network interconne

Steiner minimal trees for a class of zig

Steiner minimal trees for a class of zigzag lines

✍ R. S. Booth; J. F. Weng 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 575 KB

Vertex Degrees of Steiner Minimal Trees

Vertex Degrees of Steiner Minimal Trees inℓpdand Other Smooth Minkowski Spaces

✍ K. J. Swanepoel 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 129 KB