Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Stability Aware Delaunay Refinement, Bishal Acharya
Stability Aware Delaunay Refinement, Bishal Acharya
UNLV Theses, Dissertations, Professional Papers, and Capstones
Good quality meshes are extensively used for finding approximate solutions for partial differential equations for fluid flow in two dimensional surfaces. We present an overview of existing algorithms for refinement and generation of triangular meshes. We introduce the concept of node stability in the refinement of Delaunay triangulation. We present two algorithms for generating stable refinement of Delaunay triangulation. We also present an experimental investigation of a triangulation refinement algorithm based on the location of the center of gravity and the location of the center of circumcircle. The results show that the center of gravity based refinement is more effective …
Degree Constrained Triangulation, Roshan Gyawali
Degree Constrained Triangulation, Roshan Gyawali
UNLV Theses, Dissertations, Professional Papers, and Capstones
Triangulation of simple polygons or sets of points in two dimensions is a widely investigated problem in computational geometry. Some researchers have considered variations of triangulation problems that include minimum weight triangulation, de-launay triangulation and triangulation refinement. In this thesis we consider a constrained version of the triangulation problem that asks for triangulating a given domain (polygon or point sites) so that the resulting triangulation has an increased number of even degree vertices. This problem is called Degree Constrained Triangulation (DCT). We propose four algorithms to solve DCT problems. We also present experimental results based on the implementation of the …
Improved Algorithms For Ear-Clipping Triangulation, Bartosz Kajak
Improved Algorithms For Ear-Clipping Triangulation, Bartosz Kajak
UNLV Theses, Dissertations, Professional Papers, and Capstones
We consider the problem of improving ear-slicing algorithm for triangulating a simple polygon. We propose two variations of ear-slicing technique for generating “good-quality” triangulation. The first approach is based on searching for the best triangle along the boundary. The second approach considers polygon partitioning on a pre-process before applying the ear-slicing. Experimental investigation reveals that both approaches yield better quality triangulation than the standard ear-slicing method.