Vol. 6, No. 2, 2013

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

Volume 11, 1 issue

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
Cover Page
Editorial Board
Editors’ Addresses
Editors’ Interests
About the Journal
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Subscriptions
Editorial Login
Author Index
Coming Soon
Contacts
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
The 3-point Steiner problem on a cylinder

Denise M. Halverson and Andrew E. Logan

Vol. 6 (2013), No. 2, 251–260
Abstract

The 3-point Steiner problem in the Euclidean plane is to find the least length path network connecting three points. In this paper we will demonstrate an algorithm for solving the 3-point Steiner problem on the cylinder.

Keywords
Steiner problem, length minimization, cylinder
Mathematical Subject Classification 2010
Primary: 05C05
Secondary: 51M15
Milestones
Received: 3 August 2012
Revised: 12 September 2012
Accepted: 14 September 2012
Published: 1 September 2013

Communicated by Frank Morgan
Authors
Denise M. Halverson
Department of Mathematics
Brigham Young University
Provo, UT 84602
United States
Andrew E. Logan
Department of Mathematics
Brigham Young University
Provo, UT 84602
United States