✦ LIBER ✦

Steiner minimal trees for regular polygons

✍ Scribed by D. Z. Du; F. K. Hwang; J. F. Weng

Publisher: Springer
Year: 1987
Tongue: English
Weight: 755 KB
Volume: 2
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02187871

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Steiner minimal trees on regular polygon

Steiner minimal trees on regular polygons with centre

✍ J.F. Weng; R.S. Booth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 594 KB

Let P,,n~>3, be the set of vertices of a regular n-gon and o be the centre of P,. Let P+ = P, u [o}. In this paper we determine the Steiner minimal trees on P+. By this example we will see how complicated the Steiner problem may become if even one regular point not lying on the Steiner polygon is ad

Regular Steiner polygons

✍ M.J. Kaiser 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 347 KB

The symmetric difference area functional is minimized for a pair of planar convex polygons. Two solution procedures are outlined: a direct constructive methodology and a support function formulation. Examples illustrate the solution methodology.

On Steiner minimal trees withLpdistance

✍ Zi -Cheng Liu; Ding -Zhu Du 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 453 KB

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

Absorbing Angles, Steiner Minimal Trees,

Absorbing Angles, Steiner Minimal Trees, and

✍ H. Martini; K. J. Swanepoel; P. Oloff de Wet 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 328 KB

Minimal Steiner Trees for 2k×2kSquare La

Minimal Steiner Trees for 2k×2kSquare Lattices

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

We prove a conjecture of Chung, Graham, and Gardner (Math. Mag. 62 (1989), 83 96), giving the form of the minimal Steiner trees for the set of points comprising the vertices of a 2 k \_2 k square lattice. Each full component of these minimal trees is the minimal Steiner tree for the four vertices of