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

Absorbing Angles, Steiner Minimal Trees, and

โœ Scribed by H. Martini; K. J. Swanepoel; P. Oloff de Wet

Publisher
Springer
Year
2009
Tongue
English
Weight
328 KB
Volume
143
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hexagonal coordinate systems and steiner
Hexagonal coordinate systems and steiner minimal trees
โœ F.K. Hwang; J.f. Weng ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 483 KB

The hexagonal coordinate system consists of three axes going through a point forming six 60 ยฐ angles. The hexagonal coordinate system is natural to the Euclidean Steiner tree problem since the lines of a full Steiner minimal tree always form 120 ยฐ angles. In this paper we develop the calculus of hex

Steiner minimal trees in Lp2
Steiner minimal trees in Lp2
โœ Dietmar Cieslik; Johann Linhart ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 463 KB

For a finite set of points in a metric space a Steiner Minimal Tree (SMT) is a shortest tree which interconnects these points. We also consider a relative of this problem allowing at most k additional points in the tree (k-SMT), where k is a given number. We intend to discuss these problems for all

Full Minimal Steiner Trees on Lattice Se
Full Minimal Steiner Trees on Lattice Sets
โœ M. Brazil; J.H. Rubinstein; D.A. Thomas; J.F. Weng; N.C. Wormald ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 497 KB

Given a finite set of points P in the Euclidean plane, the Steiner problem asks us to constuct a shortest possible network interconnecting P. Such a network is known as a minimal Steiner tree. The Steiner problem is an intrinsically difficult one, having been shown to be NP-hard [7]; however, it oft