Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms
Rights accessOpen Access
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
The multi-sweeping method is one of the most used algorithms to generate hexahedral meshes for extrusion volumes. In this method the geometry is decomposed in sub-volumes by means of projecting nodes along the sweep direction and imprinting faces. However, the quality of the final mesh is determined by the location of inner nodes created during the decomposition process and by the robustness of the imprinting process. In this work we present two original contributions to increase the quality of the decomposition process. On the one hand, to improve the robustness of the imprints we introduce the new concept of computational domain for extrusion geometries. Since the computational domain is a planar representation of the sweep levels, we improve several geometric operations involved in the imprinting process. On the other hand, we propose a three-stage procedure to improve the location of the inner nodes created during the decomposition process. First, inner nodes are projected towards source surfaces. Second, the nodes are projected back towards target surfaces. Third, the final position of inner nodes is computed as a weighted average of the projections from source and target surfaces.
CitationRuiz, E.; Roca, X.; Sarrate, J. Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms. "Advances in engineering software", 2011, vol. 42, núm. 9, p. 700-713.