The Euclidean arborescence problem
| dc.contributor.advisor | Keil, Mark | en_US |
| dc.contributor.committeeMember | Srinivasan, Raj | en_US |
| dc.contributor.committeeMember | Kusalik, Anthony | en_US |
| dc.contributor.committeeMember | Cheston, Grant | en_US |
| dc.creator | Mazurek, Bradley W. | en_US |
| dc.date.accessioned | 2012-05-24T10:41:12Z | en_US |
| dc.date.accessioned | 2013-01-04T04:32:06Z | |
| dc.date.available | 2013-05-24T08:00:00Z | en_US |
| dc.date.available | 2013-01-04T04:32:06Z | |
| dc.date.created | 1996 | en_US |
| dc.date.issued | 1996 | en_US |
| dc.date.submitted | 1996 | en_US |
| dc.description.abstract | The Euclidean arborescence problem involves the creation of rooted trees embedded in the plane using the L2 distance metric. These trees are interesting in that they have a low cost yet offer responsive service from the root to any other vertex. As such, arborescences have their cost compared to that of the minimum spanning tree (MST), and their radius compared to that of the shortest path tree (SPT), which are minimal with respect to cost and radius, respectively. This research examines geometric techniques for constructing such arborescences. The central component to this research is the development of a generalized arborescence algorithm framework. Independent framework modules are used to define a unique arborescence algorithm. Arborescence properties are defined, including metrics to measure the quality of the arborescence relative to the MST cost and the SPT radius. This framework is used to describe four arborescence algorithms: the circle spanning, circle Steiner, unrestricted tangent and restricted tangent arborescence algorithms. Each algorithm is analyzed to determine its computational complexity and space requirements, as well as its theoretical performance with respect to the described quality metrics. However, because theoretical bounds for metrics are not always available or reflective of practice, empirical research was done to determine how each of the algorithms perform in practice. The results of this experimentation look quite favorably on three of the four arborescence algorithms considered. The experimental values for those three have very stable and predictable quality on large point sets, which is well under a two approximation on most metrics. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10388/etd-05242012-104112 | en_US |
| dc.language.iso | en_US | en_US |
| dc.title | The Euclidean arborescence problem | en_US |
| dc.type.genre | Thesis | en_US |
| dc.type.material | text | en_US |
| thesis.degree.department | Computer Science | en_US |
| thesis.degree.discipline | Computer Science | en_US |
| thesis.degree.grantor | University of Saskatchewan | en_US |
| thesis.degree.level | Masters | en_US |
| thesis.degree.name | Master of Science (M.Sc.) | en_US |