An Algorithm for Clipping Polygons of Large Geographical Data

dc.contributor.advisor	Childs, Hank
dc.contributor.author	Alghamdi, Areej
dc.date.accessioned	2017-09-27T21:44:23Z
dc.date.available	2017-09-27T21:44:23Z
dc.date.issued	2017-09-27
dc.description.abstract	We present an algorithm for overlaying polygonal data with regular grids and calculating the percentage overlap for each cell in the regular grid. Our algorithm is able to support self-intersecting polygons, meaning that some spatial regions may be covered by two or more polygons. Our algorithm is able to identify these cases and eliminate redundant polygons, preventing erroneous results. We also present an optimized version of our algorithm that uses spatial sorting through interval trees, and provide a performance comparison between the optimized and unoptimized versions. Finally, we apply our algorithm to geography data, specifically of bark beetle infestation	en_US
dc.identifier.uri	https://hdl.handle.net/1794/22790
dc.language.iso	en_US
dc.publisher	University of Oregon
dc.rights	All Rights Reserved.
dc.subject	Scientific Visualization	en_US
dc.title	An Algorithm for Clipping Polygons of Large Geographical Data
dc.type	Electronic Thesis or Dissertation
thesis.degree.discipline	Department of Computer and Information Science
thesis.degree.grantor	University of Oregon
thesis.degree.level	masters
thesis.degree.name	M.S.

Files

Now showing 1 - 1 of 1