Award Date

5-1-2021

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 Selvaraj

Number of Pages

41

Abstract

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.

Keywords

1.5D Terrain; Complex polygonal chain; Imai and Iri Algorithm; Polygonal approximation; Visibility Aware Approximation; Visibility Properties of Polygon

Disciplines

Computer Sciences

File Format

pdf

File Size

937

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/

Download


Share

COinS