Simultaneous untangling and smoothing of tetrahedral meshes

被引:120
作者
Escobar, JM [1 ]
Rodríguez, E [1 ]
Montenegro, R [1 ]
Montero, G [1 ]
González-Yuste, JM [1 ]
机构
[1] Univ Las Palmas Gran Canaria, Inst Intelligent Syst & Numer Applicat Engn, Las Palmas Gran Canaria 35017, Spain
关键词
mesh smoothing; mesh untangling; tetrahedral mesh generation; adaptive meshes; finite elements;
D O I
10.1016/S0045-7825(03)00299-8
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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. The objective function is 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 R-3 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 R-3. With these modifications, the optimisation process is also directly applicable to meshes with inverted elements, making a previous untangling procedure unnecessary. This simultaneous procedure allows to reduce the number of iterations for reaching a prescribed quality. To illustrate the effectiveness of our approach, we present several applications where it can be seen that our results clearly improve those obtained by other authors. (C) 2003 Published by Elsevier Science B.V.
引用
收藏
页码:2775 / 2787
页数:13
相关论文
共 26 条
[1]   Mesh smoothing using a posteriori error estimates [J].
Bank, RE ;
Smith, RK .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1997, 34 (03) :979-997
[2]  
Bazaraa M.S., 2013, Nonlinear Programming-Theory and Algorithms, V3rd
[3]  
Buscaglia GC, 1997, INT J NUMER METH ENG, V40, P4119, DOI 10.1002/(SICI)1097-0207(19971130)40:22<4119::AID-NME254>3.0.CO
[4]  
2-R
[5]  
DJIDJEV HN, 2000, FORCE DIRECTED METHO
[6]  
DOMPIERRE J, 1998, P 7 INT MESH ROUNDT, P459
[7]   Several aspects of three-dimensional Delaunay triangulation [J].
Escobar, JM ;
Montenegro, R .
ADVANCES IN ENGINEERING SOFTWARE, 1996, 27 (1-2) :27-39
[8]   EFFICIENT REFINEMENT DEREFINEMENT ALGORITHM OF NESTED MESHES TO SOLVE EVOLUTION PROBLEMS [J].
FERRAGUT, L ;
MONTENEGRO, R ;
PLAZA, A .
COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING, 1994, 10 (05) :403-412
[9]   A parallel algorithm for mesh smoothing [J].
Freitag, L ;
Jones, M ;
Plassmann, P .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1999, 20 (06) :2023-2040
[10]  
FREITAG L, 1999, ANLMCSTM239