Skip to Main content Skip to Navigation
Book sections

Robust Boundary Layer Mesh Generation

Abstract : In this paper, we introduce a 3D local operator that automatically combines typical simpler operators as removal of vertices, collapse of edges or swap of faces and edges. This operator is inherited from incremental methods where the mesh k is modified iteratively through sequences of insertion of a point P: Hk+1=Hk−CP+BP, where CP is the cavity of P and BP the ball of P. We derive two algorithms to compute Cp . The first algorithm is tuned to be a fast point reprojection to the geometry even in the presence of a boundary layer mesh. The second one is tuned to generate boundary layer meshes for complex geometries. We show how quasi-structured elements can be enforced. In addition, enhancements as multi-normals can be incorporated in the process. Both operators can be used with surface and volume point while preserving a given geometry. They rely on the use on an existing initial volume mesh and always produce a valid 3D mesh on output.
Document type :
Book sections
Complete list of metadata
Contributor : Adrien Loseille <>
Submitted on : Thursday, January 23, 2014 - 1:11:06 PM
Last modification on : Thursday, March 11, 2021 - 9:42:02 PM

Links full text





Adrien Loseille, Rainald Löhner. Robust Boundary Layer Mesh Generation. Jiao, Xiangmin and Weill, Jean-Christophe. Proceedings of the 21st International Meshing Roundtable, Springer Berlin Heidelberg, pp.493-511, 2012, 978-3-642-33572-3. ⟨10.1007/978-3-642-33573-0_29⟩. ⟨hal-00935315⟩



Record views