Date of Award:
12-2020
Document Type:
Thesis
Degree Name:
Master of Science (MS)
Department:
Computer Science
Committee Chair(s)
John Edwards
Committee
John Edwards
Committee
Xiaojun Qi
Committee
Minghui Jiang
Abstract
Voronoi Diagrams can provide useful spatial information. Little work has been done on computing exact Voronoi Diagrams when the sites are more complex than a point. We introduce a technique that measures the exact Generalized Voronoi Diagram from points, line segments and, connected lines including lines that connect to form simple polygons. Our technique is an extension of Fortune’s method. Our approach treats connected lines (or polygons) as a single site.
Checksum
db8107da3c9f8ab5ffafde7204dfdb1c
Recommended Citation
Marsden, Daniel, "Exact Generalized Voronoi Diagram Computation using a Sweepline Algorithm" (2020). All Graduate Theses and Dissertations, Spring 1920 to Summer 2023. 7947.
https://digitalcommons.usu.edu/etd/7947
Included in
Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .