An improved procedure for 2D unstructured Delaunay mesh generation

This paper presents a procedure for the discretization of 2D domains using a Delaunay triangulation. Improvements over existing similar methods are introduced, proposing in particular a multi-constraint insertion algorithm, very effective in the presence of highly irregular domains, and the topological-structure used together with its primitives. The method obtained requires limited input and can be applied to a wide class of-domains. Quadrilateral subdivisions with a control of the aspect ratio of the generated elements can a] so be reached. Further it is suitable for evolutionary problems, Which require continuous updating of the, discretization. Presented applications and comparisons with other discretization methods demonstrate the effectiveness of the procedure.