✦ LIBER ✦

Rotationally optimal spanning and Steiner trees in uniform orientation metrics

✍ Scribed by Marcus Brazil; Benny K. Nielsen; Pawel Winter; Martin Zachariasen

Book ID: 108100925
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 174 KB
Volume: 29
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.04.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Flexibility of Steiner trees in uniform

Flexibility of Steiner trees in uniform orientation metrics

✍ M. Brazil; P. Winter; M. Zachariasen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB

Canonical Forms and Algorithms for Stein

Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics

✍ M. Brazil; D. A. Thomas; J. F. Weng; M. Zachariasen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 312 KB

Forbidden subpaths for Steiner minimum n

Forbidden subpaths for Steiner minimum networks in uniform orientation metrics

✍ M. Brazil; D. A. Thomas; J. F. Weng 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB

## Abstract The Steiner problem in the λ‐plane is the problem of constructing a minimum network connecting a given set of nodes (called terminals), with the constraint that all line segments have slopes chosen from the λ uniform orientation angles ω, 2ω, … , λω, where ω = π/λ. This problem appears