Several aspects of three-dimensional Delaunay triangulation
Advances in Engineering Software
Mesh Smoothing Using A Posteriori Error Estimates
SIAM Journal on Numerical Analysis
A Parallel Algorithm for Mesh Smoothing
SIAM Journal on Scientific Computing
Efficient strategies for adaptive 3-D mesh generation over complex orography
Neural, Parallel & Scientific Computations
Algebraic Mesh Quality Metrics
SIAM Journal on Scientific Computing
Tetrahedral Mesh Generation for Environmental Problems over Complex Terrains
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Parameter Estimation in a Three-Dimensional Wind Field Model Using Genetic Algorithms
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
| Hi-index | 0.00 |
The quality improvement in mesh optimisation techniques that preserve its connectivity are obtained by an iterative process in which each node of the mesh is moved to a new position that minimises a certain objective function. In general, objective functions are derived from some quality measure of the local submesh, that is, the set of tetrahedra connected to the adjustable or free node. Although these objective functions are suitable to improve the quality of a mesh in which there are non inverted elements, they are not when the mesh is tangled. This is due to the fact that usual objective functions are not defined on all R3 and they present several discontinuities and local minima that prevent the use of conventional optimisation procedures. Otherwise, when the mesh is tangled, there are local submeshes for which the free node is out of the feasible region, or this does not exist. In this paper we propose the substitution of objective functions having barriers by modified versions that are defined and regular on all R3. With these modifications, the optimisation process is also directly applicable to meshes with inverted elements, making a previous untangling procedure unnecessary.