Journal of Computational Physics
Incremental Delaunay triangulation
Graphics gems IV
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Adaptive triangular element generation and optimization-based smoothing, Part 1: On the plane
Advances in Engineering Software
Hi-index | 0.00 |
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 also 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.