Award Date

5-1-2020

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Laxmi Gewali

Second Committee Member

Kazem Taghva

Third Committee Member

Wolfgang Bein

Fourth Committee Member

Henry Salvaraj

Number of Pages

56

Abstract

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.

Keywords

Component Kernel; Der-Tsai Lee; Kernel; Polygon; Star-Polygon; Visibility

Disciplines

Computer Sciences

File Format

pdf

File Size

1.4 MB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Rights

IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/


Share

COinS