Award Date

5-2011

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Laxmi Gewali, Chair

Second Committee Member

Evangelos A. Yfantis

Third Committee Member

Jan B. Pedersen

Graduate Faculty Representative

Henry Selvaraj

Number of Pages

49

Abstract

This thesis presents an efficient algorithm for recognizing and extracting sharp-features from polygonal shapes. As used here, a sharp-feature is a distinct portion of a polygon that is long and skinny. The algorithm executes in O(n^2) time, where n is the number of vertices in the polygon. Experimental results from a Java implementation of the algorithm are also presented.

Keywords

Boundary value problems; Computational geometry; Computer algorithms; Perimeters (Geometry); Polygons

Disciplines

Computer Sciences | Geometry and Topology | Theory and Algorithms

File Format

pdf

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