Award Date
May 2017
Degree Type
Thesis
Degree Name
Master of Science (MS)
Department
Computer Science
First Committee Member
Laxmi Gewali
Second Committee Member
John Minor
Third Committee Member
Justin Zhan
Fourth Committee Member
Henry Selvaraj
Number of Pages
53
Abstract
Generating constrained triangulations of point sites distributed in the plane is a significant problem in computational geometry. We present theoretical and experimental investigation results for generating triangulations for polygons and point sites that address node degree constraints. We characterize point sites that have almost all vertices of odd degree. We present experimental results on the node degree distribution of Delaunay triangulations of point sites generated randomly. Additionally, we present a heuristic algorithm for triangulating a given normal annular region with an increment of even degree nodes.
Disciplines
Computer Sciences
File Format
Degree Grantor
University of Nevada, Las Vegas
Language
English
Repository Citation
Gurung, Bhaikaji, "Degree Constrained Triangulation of Annular Regions and Point Sites" (2017). UNLV Theses, Dissertations, Professional Papers, and Capstones. 2979.
http://dx.doi.org/10.34917/10985918
Rights
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/