Mesh Optimization in Three Dimensions
Abstract
We discuss an optimization procedure for improving three-dimensional finite element meshes. Our method can be
effectively coupled with any automatic mesh generator in order to obtain a triangulation without badly disloned
elemems. In this way, we are able to weaken the requirements on the generator, allowing it to produce singular elements, and post-process the result to get a valid mesh.
Even though several other methods to improve finite element meshes already exist, the proposed one is the first to incorporate wbal finite element practitioners have for long known: One bad elemem renders the mesh useless. We report some very encouraging results with a quite crude algorithm. Our conclusion is that building meshes combining an initial generation step followed hy an optimization step makes the meshing of arbitrary domains much more reliable, as compared to the usual approach of precluding distorted elements during the initial generation stage.
effectively coupled with any automatic mesh generator in order to obtain a triangulation without badly disloned
elemems. In this way, we are able to weaken the requirements on the generator, allowing it to produce singular elements, and post-process the result to get a valid mesh.
Even though several other methods to improve finite element meshes already exist, the proposed one is the first to incorporate wbal finite element practitioners have for long known: One bad elemem renders the mesh useless. We report some very encouraging results with a quite crude algorithm. Our conclusion is that building meshes combining an initial generation step followed hy an optimization step makes the meshing of arbitrary domains much more reliable, as compared to the usual approach of precluding distorted elements during the initial generation stage.
Full Text:
PDFAsociación Argentina de Mecánica Computacional
Güemes 3450
S3000GLN Santa Fe, Argentina
Phone: 54-342-4511594 / 4511595 Int. 1006
Fax: 54-342-4511169
E-mail: amca(at)santafe-conicet.gov.ar
ISSN 2591-3522