z-logo
Premium
Simultaneous surface and tetrahedron mesh adaptation using mesh‐free techniques
Author(s) -
Rassineux A.,
Breitkopf P.,
Villon P.
Publication year - 2003
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.681
Subject(s) - tetrahedron , t vertices , surface (topology) , polygon mesh , mesh generation , triangle mesh , interpolation (computer graphics) , laplacian smoothing , process (computing) , isosurface , computer science , topology (electrical circuits) , hexahedron , mathematics , geometry , algorithm , finite element method , engineering , computer graphics (images) , structural engineering , visualization , artificial intelligence , combinatorics , animation , operating system
Abstract We present a method to adapt a tetrahedron mesh together with a surface mesh with respect to a size criterion. The originality of our work lies in the fact that both surface and tetrahedron mesh adaptation are carried out simultaneously and that no CAD is required to adapt the surface mesh. The adaptation procedure consists of splitting or removing interior and surface edges which violate a given size criterion. The enrichment process is based on a bisection technique. In order to guarantee mesh conformity during the refinement process, all possible remeshing configurations of tetrahedra have been examined. Once the tetrahedron mesh has been adapted, surface nodes are projected on a geometrical model. The building of a surface model from discrete data has already been presented in this journal. The method is based on a mesh‐free technique called Hermite Diffuse Interpolation. Surface and volume mesh optimization procedures are carried out during the adaptation and at the end of the process to enhance the mesh. Copyright © 2003 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here