Vol. 4, No. 4, 2011

Download this article
Download this article For screen
For printing
Recent Issues

Volume 11
Issue 2, 181–359
Issue 1, 1–179

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editors’ Addresses
Editors’ Interests
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Editorial Login
Author Index
Coming Soon
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
The Steiner problem on the regular tetrahedron

Kyra Moon, Gina Shero and Denise Halverson

Vol. 4 (2011), No. 4, 365–404

The Steiner problem involves finding a shortest path network connecting a specified set of points. In this paper, we examine the Steiner problem for three points on the surface of a regular tetrahedron. We prove several important properties about Steiner minimal trees on a regular tetrahedron. There are infinitely many ways to connect three points on a tetrahedron, so we present a way to eliminate all but a finite number of possible solutions. We provide an algorithm for finding a shortest network connecting three given points on a regular tetrahedron. The solution can be found by direct measurement of the remaining possible Steiner trees.

Steiner problem, length minimization, regular tetrahedron, piecewise-linear surface
Mathematical Subject Classification 2010
Primary: 05C05
Secondary: 51M15
Received: 14 January 2011
Revised: 22 March 2011
Accepted: 24 March 2011
Published: 21 March 2012

Communicated by Frank Morgan
Kyra Moon
Mathematics Department
Brigham Young University
275 TMCB
Provo, UT 84602
United States
Gina Shero
Mathematics Department
Clarion University of Pennsylvania
189 STC
840 Wood Street
Clarion, PA 16214
United States
Denise Halverson
Mathematics Department
Brigham Young University
263 TMCB
Provo, UT 84602
United States