Master of Science in Computer Science
First Committee Member
Laxmi P. Gewali
Second Committee Member
Third Committee Member
Fourth Committee Member
Number of Pages
Constructing a two dimensional shape from given a set of point sites is a well known problem in computation geometry. We present a critical review of the existing algorithms for constructing polygonal shapes. We present a new approach calledinward dentingfor constructing simple polygons. We then extend the proposed approach for modeling polygons with holes. This is the
first known algorithm for modeling holes in the interior of 2d shapes. We also present experimental investigations of the quality of the solutions generated by the proposed algorithms.
For this we implemented the proposed algorithms in Java programming language. The prototype program can be executed by users to enter point sites interactively. The experimental results show that the perimeter of the generated shape is at most 33% more than the length of the minimum spanning tree.
Computational Geometry; Convex Hull; Generation of geometric forms; Holes; Inward Denting; Polygons – Computer simulation; Random Generation Polygon
Computer Sciences | Geometry and Topology | Theory and Algorithms
Hada, Pratik Shankar, "Approaches for Generating 2D Shapes" (2014). UNLV Theses, Dissertations, Professional Papers, and Capstones. 2182.