Master of Science in Computer Science
First Committee Member
Laxmi Gewali, Chair
Second Committee Member
Evangelos A. Yfantis
Third Committee Member
Jan B. Pedersen
Graduate Faculty Representative
Number of Pages
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.
Boundary value problems; Computational geometry; Computer algorithms; Perimeters (Geometry); Polygons
Computer Sciences | Geometry and Topology | Theory and Algorithms
Scanlan, Joseph P., "Sharp feature identification in a polygon" (2011). UNLV Theses, Dissertations, Professional Papers, and Capstones. 965.