Parallel algorithms for polygonal and rectilinear geometry.
dc.contributor.author | Guha, Sumanta | en_US |
dc.contributor.advisor | Stout, Q. | en_US |
dc.date.accessioned | 2014-02-24T16:29:40Z | |
dc.date.available | 2014-02-24T16:29:40Z | |
dc.date.issued | 1991 | en_US |
dc.identifier.other | (UMI)AAI9208547 | en_US |
dc.identifier.uri | http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9208547 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/105696 | |
dc.description.abstract | Parallel algorithms are presented for geometric problems of two types: problems about simple polygons and problems dealing with the rectilinear metric. Of the first type, an important result presented is an efficient parallel algorithm to compute shortest paths and shortest path trees in simple polygons. Applications of this shown include an efficient parallel algorithm to compute farthest neighbors of vertices of a simple polygon (both with distances measured by shortest paths internal and external to the polygon), an efficient parallel algorithm to determine if two simple polygons may be separated by a single translation, and an NC algorithm to compute the Voronoi diagram of a set of points inside a simple polygon. Another result presented is an optimal parallel algorithm to decide if a simple polygon is monotone. Of the second type, the important result obtained is an optimal parallel algorithm to compute the Voronoi diagram of a set of points on the plane under the rectilinear metric. Another result is an NC algorithm to find the shortest rectilinear path between two points on the plane avoiding rectangular barriers. The third result presented is an optimal parallel algorithm to bipartition a planar point set into two subsets of prescribed rectilinear diameter. | en_US |
dc.format.extent | 217 p. | en_US |
dc.subject | Computer Science | en_US |
dc.title | Parallel algorithms for polygonal and rectilinear geometry. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Computer Science and Engineering | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/105696/1/9208547.pdf | |
dc.description.filedescription | Description of 9208547.pdf : Restricted to UM users only. | en_US |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.