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 条
  • [31] The finite cell method for tetrahedral meshes
    Duczek, Sascha
    Duvigneau, Fabian
    Gabbert, Ulrich
    FINITE ELEMENTS IN ANALYSIS AND DESIGN, 2016, 121 : 18 - 32
  • [32] Multiresolution tetrahedral meshes: an analysis and a comparison
    Danovaro, E
    De Floriani, L
    Lee, M
    Samet, H
    SHAPE MODELING AND APPLICATIONS, PROCEEDINGS, 2002, : 83 - +
  • [33] Properties of Laplace Operators for Tetrahedral Meshes
    Alexa, Marc
    Herholz, Philipp
    Kohlbrenner, Maximilian
    Sorkine-Hornung, Olga
    COMPUTER GRAPHICS FORUM, 2020, 39 (05) : 55 - 68
  • [34] Modeling subsurface phenomena for tetrahedral meshes
    White, Barry C.
    Eslinger, Owen J.
    PROCEEDINGS OF THE HPCMP USERS GROUP CONFERENCE 2006, 2006, : 212 - 217
  • [35] A data compression method for tetrahedral meshes
    Ueng, SK
    Sikorski, K
    VISUALIZATION AND DATA ANALYSIS 2002, 2002, 4665 : 134 - 141
  • [36] A new method for coarsening tetrahedral meshes
    Liu, Jianfei
    Shang, Feifei
    Song, Ting
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2017, 112 (13) : 2048 - 2066
  • [37] Parallel refinement and coarsening of tetrahedral meshes
    de Cougny, HL
    Shephard, MS
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1999, 46 (07) : 1101 - 1125
  • [38] Streaming compression of tetrahedral volume meshes
    Isenburg, Martin
    Lindstrom, Peter
    Gumhold, Stefan
    Shewchuk, Jonathan
    GRAPHICS INTERFACE 2006, PROCEEDINGS, 2006, : 115 - +
  • [39] Adaptive kernel for triangular meshes smoothing
    Fouad El Ouafdi, Ahmed
    El Houari, Hassan
    2015 INTELLIGENT SYSTEMS AND COMPUTER VISION (ISCV), 2015,
  • [40] Untangling polygonal and polyhedral meshes via mesh optimization
    Jibum Kim
    Jaeyong Chung
    Engineering with Computers, 2015, 31 : 617 - 629