Engineering Mechanics

Proceedings Vol. 21 (2015)

ENGINEERING MECHANICS 2015

Copyright © 2015 Institute of Theoretical and Applied Mechanics, Academy of Sciences of the Czech Republic, v.v.i., Prague

 

D. Rypl, J. Vesecký
pages 268 - 269, full text

Presented paper focuses on the transfer of finite element data between simplex finite element meshes representing different discretizations of the same geometrical model. The construction of the localization map, defining for each node of the target mesh, onto which the data are to be transferred, the closest element of the original source mesh, is based on the walking algorithm, performing a traversal between neighbouring elements of the source mesh from an initial element towards the processed node. To make the algorithm efficient and reliable, individual nodes of the target mesh are processed in special order given by the nodal connectivity of the target mesh. The implementation also relies on the classification of the processed meshes to the underlying geometrical model. Once the localization map is available, data from the source mesh are mapped to nodes of the target mesh in parallel (using threads) by the help of shape functions of the elements of the source mesh.

Text and facts may be copied and used freely, but credit should be given to these Proceedings.

All papers were reviewed by members of the scientific committee.