A Parallel Local Reconnection Approach for Tetrahedral Mesh Improvement | Zendy

Shang Mengmeng | Zendy; Zhu Chao-yan | Zendy; Jianjun Chen | Zendy; Zhoufang Xiao | Zendy; Yao Zheng | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Parallel Local Reconnection Approach for Tetrahedral Mesh Improvement

Author(s) -

Shang Mengmeng,

Zhu Chao-yan,

Jianjun Chen,

Zhoufang Xiao,

Yao Zheng

Publication year - 2016

Publication title -

procedia engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.32

H-Index - 74

ISSN - 1877-7058

DOI - 10.1016/j.proeng.2016.11.062

Subject(s) - hilbert curve , smoothing , laplacian smoothing , polygon mesh , tetrahedron , algorithm , computer science , feature (linguistics) , point (geometry) , t vertices , distribution (mathematics) , mathematical optimization , mathematics , mesh generation , geometry , structural engineering , engineering , mathematical analysis , computer graphics (images) , finite element method , computer vision , linguistics , philosophy

A multi-threaded parallel local reconnection algorithm is proposed for tetrahedral meshes. It defines a feature point within the region involved in each operation, and sorts the features points along a Hilbert curve. The decomposition of this Hilbert curve results in a load-balanced distribution of local operations. Meanwhile, the regions of concurrently executed local operations are separated far away, such that the possibility of interference is reduced to a very low level. Finally, a parallel mesh improver is developed by combining the proposed algorithm with a parallel mesh smoothing algorithm, and its effectiveness and efficiency is verified in various numerical experiments

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research