๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Steiner minimal trees for a class of zigzag lines

โœ Scribed by R. S. Booth; J. F. Weng

Publisher
Springer
Year
1992
Tongue
English
Weight
575 KB
Volume
7
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A class of full Steiner minimal trees
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).

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