Reconstruction results attempt to rebuild polygons from visibility information. Reconstruction of a general polygon from its visibility graph is still open and only known to be in PSPACE; thus additional information, such as the ordering of the edges around nodes that corresponds to the order of the visibilities around vertices is frequently added. The first section of this thesis extracts, in o(E) time, the Hamiltonian cycle that corresponds to the boundary of the polygon from the polygon's ordered visibility graph. Also, it converts an unordered visibility graph and Hamiltonian cycle to the ordered visibility graph for that polygon in O(E) time. The secod, and major result is an algorithm to reconstruct an arthogonal polygon that is consistent with the Hamiltonian cylce and visibility stabs of the sides of an unknown polygon. The algorithm uses O(nlogn) time, assuming there are no collinear sides, and )(n2) time otherwise. / vii, 78 leaves ; 28 cm.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:ALU.w.uleth.ca/dspace#10133/41 |
| Date | January 1996 |
| Creators | Jackson, LillAnne Elaine, University of Lethbridge. Faculty of Arts and Science |
| Contributors | Wismath, Stephen |
| Publisher | Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 1996, Arts and Science, Department of Mathematics and Computer Science |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Relation | Thesis (University of Lethbridge. Faculty of Arts and Science) |
Page generated in 0.002 seconds