Master of Science in Computer Science
First Committee Member
Second Committee Member
Third Committee Member
Fourth Committee Member
Number of Pages
The kernel of a simple polygon is the set of points in its interior from which all points inside the polygon are visible. We formally establish that for a given convex polygon Q we can always construct a larger simple polygon with many reflex vertices such that Q is the kernel of P. We present algorithms for decomposing a strongly monotone polygon into star-polygons. This decomposition is applied for developing an efficient algorithm for placing a small number of vertical towers to cover the entire given 1.5D terrain. We also present an experimental investigation of the proposed algorithm. The implementation is done in the Java programming language and the resulting prototype supports a user-friendly interface.
Component Kernel; Der-Tsai Lee; Kernel; Polygon; Star-Polygon; Visibility
University of Nevada, Las Vegas
Mark, Jason, "Studies on Kernels of Simple Polygons" (2020). UNLV Theses, Dissertations, Professional Papers, and Capstones. 3923.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/