Master of Science in Computer Science
First Committee Member
Second Committee Member
Third Committee Member
Fourth Committee Member
Number of Pages
The problem of simplifying a complex shape with simpler ones is an important research area in computer science and engineering. In this thesis, we investigate the effect on the visibility properties of polygons when their boundaries are approximated to make them simpler. We present two algorithms for approximating a restricted class of polygons called 1.5 D terrain. We also present experimental investigations on the performance of reviewed and proposed approximation algorithms.
1.5D Terrain; Complex polygonal chain; Imai and Iri Algorithm; Polygonal approximation; Visibility Aware Approximation; Visibility Properties of Polygon
University of Nevada, Las Vegas
Jha, Samridhi, "Effect of Boundary Approximation on Visibility" (2021). UNLV Theses, Dissertations, Professional Papers, and Capstones. 4154.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/