The n-point Steiner problem in the Euclidean plane is to find a least length path network connecting n points. In this thesis we will demonstrate how to find a least length path network T connecting n points on a closed 2-dimensional Riemannian surface of constant curvature by determining a region in the covering space that is guaranteed to contain T. We will then provide an algorithm for solving the n-point Steiner problem on such a surface.
| Identifer | oai:union.ndltd.org:BGMYU2/oai:scholarsarchive.byu.edu:etd-5419 |
| Date | 01 March 2015 |
| Creators | Logan, Andrew |
| Publisher | BYU ScholarsArchive |
| Source Sets | Brigham Young University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | http://lib.byu.edu/about/copyright/ |
Page generated in 0.0021 seconds