Simultaneous untangling and smoothing of tetrahedral meshes

被引:118
|
作者
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
相关论文
共 50 条
  • [41] Untangling polygonal and polyhedral meshes via mesh optimization
    Kim, Jibum
    Chung, Jaeyong
    ENGINEERING WITH COMPUTERS, 2015, 31 (03) : 617 - 629
  • [42] Untangling of 2D meshes in ALE simulations
    Vachal, P
    Garimella, RV
    Shashkov, MJ
    JOURNAL OF COMPUTATIONAL PHYSICS, 2004, 196 (02) : 627 - 644
  • [43] Refinement strategies related to cubic tetrahedral meshes
    Petrov, Miroslav S.
    Todorov, Todor D.
    APPLIED NUMERICAL MATHEMATICS, 2019, 137 : 169 - 183
  • [44] On an automatically parallel generation technique for tetrahedral meshes
    Globisch, G
    PARALLEL COMPUTING, 1995, 21 (12) : 1979 - 1995
  • [45] Optimized Dual-Volumes for Tetrahedral Meshes
    Jacobson, Alec
    COMPUTER GRAPHICS FORUM, 2024, 43 (05)
  • [46] Simplification of tetrahedral meshes with accurate error evaluation
    Cignoni, P
    Costanza, D
    Montani, C
    Rocchini, C
    Scopigno, R
    VISUALIZATION 2000, PROCEEDINGS, 2000, : 85 - 92
  • [47] Generation of Combined-Modality Tetrahedral Meshes
    Gillette, Karli
    Tate, Jess
    Kindall, Brianna
    Van Dam, Peter
    Kholmovski, Eugene
    MacLeod, Rob S.
    2015 COMPUTING IN CARDIOLOGY CONFERENCE (CINC), 2015, 42 : 953 - 956
  • [48] Locally adapted tetrahedral meshes using bisection
    Arnold, DN
    Mukherjee, A
    Pouly, L
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2000, 22 (02): : 431 - 448
  • [49] Highly Adaptive Liquid Simulations on Tetrahedral Meshes
    Ando, Ryoichi
    Thuerey, Nils
    Wojtan, Chris
    ACM TRANSACTIONS ON GRAPHICS, 2013, 32 (04):
  • [50] Time-critical rendering of tetrahedral meshes
    Yang, Chuan-Kai
    Chiueh, Tzi-Cker
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2007, 23 (05) : 1437 - 1451