An algorithm for tessellation of 2D planar domain with holes

Abstract

Surface tessellation is an important prerequisite for much analytical software. Also, tessellating a surface gives good visualization in the computer. The process of surface tessellation in general and surface triangulation in particular is a tricky process if an unstructured mesh is to be generated and becomes more intriguing if the surface under consideration involves holes and subsurfaces inside it. The paper presents the implementation of an algorithm for surface tessellation. The algorithm generates constrained Delaunay triangulation, an unstructured grid of a two dimensional surface involving holes. The generalized algorithm uses a simple data format to describe the domain known as planar straight line graph (PSLG) which is a collection of points and edges.