Generating Kernel Aware Polygons

Author

Bibek SubediFollow

Award Date

May 2019

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Laxmi Gewali

Second Committee Member

John Minor

Third Committee Member

Kazem Taghva

Fourth Committee Member

Henry Selvaraj

Number of Pages

62

Abstract

Problems dealing with the generation of random polygons has important applications for evaluating the performance of algorithms on polygonal domain. We review existing algorithms for generating random polygons. We present an algorithm for generating polygons admitting visibility properties. In particular, we propose an algorithm for generating polygons admitting large size kernels. We also present experimental results on generating such polygons.

Keywords

Computational Geometry

Disciplines

Computer Sciences

File Format

pdf

Degree Grantor

University of Nevada, Las Vegas

Language

English

Repository Citation

Subedi, Bibek, "Generating Kernel Aware Polygons" (2019). UNLV Theses, Dissertations, Professional Papers, and Capstones. 3684.
http://dx.doi.org/10.34917/15778552

Rights

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