mesh quality improvement
Recently Published Documents


TOTAL DOCUMENTS

28
(FIVE YEARS 1)

H-INDEX

9
(FIVE YEARS 0)

Symmetry ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 895 ◽  
Author(s):  
Junhyeok Choi ◽  
Harrim Kim ◽  
Shankar Prasad Sastry ◽  
Jibum Kim

We propose a novel deviation-based vertex reordering method for 2D mesh quality improvement. We reorder free vertices based on how likely this is to improve the quality of adjacent elements, based on the gradient of the element quality with respect to the vertex location. Specifically, we prioritize the free vertex with large differences between the best and the worst-quality element around the free vertex. Our method performs better than existing vertex reordering methods since it is based on the theory of non-smooth optimization. The downhill simplex method is employed to solve the mesh optimization problem for improving the worst element quality. Numerical results show that the proposed vertex reordering techniques improve both the worst and average element, compared to those with existing vertex reordering techniques.


2018 ◽  
Vol 70 ◽  
pp. 17-27 ◽  
Author(s):  
Kaoji Xu ◽  
Xifeng Gao ◽  
Guoning Chen

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Jibum Kim ◽  
Myeonggyu Shin ◽  
Woochul Kang

We propose a derivative-free mesh optimization algorithm, which focuses on improving the worst element quality on the mesh. The mesh optimization problem is formulated as a min-max problem and solved by using a downhill simplex (amoeba) method, which computes only a function value without needing a derivative of Hessian of the objective function. Numerical results show that the proposed mesh optimization algorithm outperforms the existing mesh optimization algorithm in terms of improving the worst element quality and eliminating inverted elements on the mesh.


Sign in / Sign up

Export Citation Format

Share Document