GENERATING TRIANGULAR LATTICES FOR SURFACES WITH IRREGULAR BOUNDARY
Tatiana Sá Marques, Vítor Dias da Silva · 2016
In this contribution algorithms for the generation of triangular lattice meshes for surfaces with an irregular boundary are presented.A central objective of this study was to get meshes with the maximum possible number of bars of a given length.Three different approaches are described.In all three the meshing process starts at the boundary and advances to the central part of the domain, by defining successive rings of bars.The differences between the three algorithms lie on the different ways as the problem of node elimination and smoothing is solved, as the rings become smaller.Algorithm A relies on the Delauney criterion for mesh smoothing.Algorithm B uses Bézier curves to approximate the cloud of initially generated points in a new ring, when smoothing is necessary.In algorithm C first an automatic elimination of points is performed, when the points in the new ring ate too close, which is followed by a relocation of interactively chosen points.A representative example is presented, allowing a comparison of the performance of the three approaches.