2015
DOI: 10.1016/j.advengsoft.2014.09.021
|View full text |Cite
|
Sign up to set email alerts
|

Simultaneous untangling and smoothing of quadrilateral and hexahedral meshes using an object-oriented framework

Abstract: In this work, we present a simultaneous untangling and smoothing technique for quadrilateral and hexahedral meshes. The algorithm iteratively improves a quadrilateral or hexahedral mesh by minimizing an objective function defined in terms of a regularized algebraic distortion measure of the elements. We propose several techniques to improve the robustness and the computational efficiency of the optimization algorithm. In addition, we have adopted an object-oriented paradigm to create a common framework to smoo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(10 citation statements)
references
References 36 publications
0
10
0
Order By: Relevance
“…While these inverted elements are not a problem for solving Poisson problems, it prevents using these meshes for other PDEs like non‐linear elasticity. This is a limitation shared with most recent hexahedral meshing and improvement methods [Knu00, Knu03, BDK*03, Mar09, GSZ11, NRP11, HTWB11, LLX*12, WSRRR*12, JHW*14, LVS*13, HJS*14, RGRS14, RGRS*15, LSVT15, GMD*16, GDC15, LMPS16, Mar16, FXBH16, FBL16, LBK16, GPW*17, CAS*19] and we believe is an important direction to find a way to integrate conservative inversion checks such as [Zha19] into a mesh optimization framework.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…While these inverted elements are not a problem for solving Poisson problems, it prevents using these meshes for other PDEs like non‐linear elasticity. This is a limitation shared with most recent hexahedral meshing and improvement methods [Knu00, Knu03, BDK*03, Mar09, GSZ11, NRP11, HTWB11, LLX*12, WSRRR*12, JHW*14, LVS*13, HJS*14, RGRS14, RGRS*15, LSVT15, GMD*16, GDC15, LMPS16, Mar16, FXBH16, FBL16, LBK16, GPW*17, CAS*19] and we believe is an important direction to find a way to integrate conservative inversion checks such as [Zha19] into a mesh optimization framework.…”
Section: Discussionmentioning
confidence: 99%
“…The topological complexity can also be reduced using local operations [BLK11, TPP*11, MPKZ10, GDC15, GPW*17]. The geometrical quality of a hex‐mesh can also be improved relocating its nodes without changing their connectivity [Knu00, Knu03, BDK*03, WSRRR*12, RGRS14, RGRS*15, LSVT15, XGC18]. All these methods are orthogonal to our contribution and could be used to postprocessing our meshes for specific applications.…”
Section: Related Workmentioning
confidence: 99%
“…Then, we define the objective function as ffalse(boldxfalse)=truej=1mηEjfalse(bold-italicJbold-italicϕfalse), where E j is the j th element adjacent to the node. The derivatives of the objective function are evaluated analytically according to Ruiz‐Gironés et al…”
Section: Surface Insertion Algorithmmentioning
confidence: 99%
“…where E j is the jth element adjacent to the node. The derivatives of the objective function are evaluated analytically according to Ruiz-Gironés et al 32…”
Section: Objective Functionmentioning
confidence: 99%
“…However, these methods suffer from several drawbacks: they tend to produce unnecessarily high resolution meshes, they are not invariant to rotation (i.e., the same volume can be meshed differently, when rotated) and they tend to push the elements of worst quality near the boundary. Our method is rotationally invariant and generates boundary conforming hexmeshes (Figure ) with much less elements, also promoting high quality hexahedra near the boundary, an important requirement to ensure accurate simulations [RGRS*15].…”
Section: Related Workmentioning
confidence: 99%