AN APPROACH TO THE GENERATION OF TRIANGULAR GRIDS POSSESSING FEW OBTUSE TRIANGLES

A triangular mesh generator is presented which makes extensive use of side swapping and mesh smoothing to create a grid with few obtuse triangles. To perform the above task a data structure is presented which holds full adjacency information both for nodes and elements. It is shown how this data structure is employed in the process mesh generation, and how the methods of computational geometry such as region decomposition are used not only to decompose a complex region, but also to reflect the boundary grading into the interior the region. Algorithms are provided to show the mechanism of these processes and practical examples are given to support the approach. Copyright © 1990 John Wiley & Sons, Ltd