A New Procedure to Compute Imprints in Multi-sweeping Algorithms

Abstract

Abstract.One of the most widely used algorithms to generate hexahedral meshes in extrusion volumes with several source and target surfaces is the multi-sweeping method. However, the multi-sweeping method is highly dependent on the final location of the nodes created during the decomposition process. Moreover, inaccurate location of inner nodes may generate erroneous imprints of the geometry surfaces such that a final mesh could not be generated. In this work, we present a new procedure to decompose the geometry in many-to-one sweepable volumes. The decomposition is based on a least-squares approximation of affine mappings defined between the loops of nodes that bound the sweep levels. In addition, we introduce the concept of computational domain, in which every sweep level is planar. We use this planar representation for two purposes. On the one hand, we use it to perform all the imprints between surfaces. Since the computational domain is planar, the robustness of the imprinting process is increased. On the other hand, the computational domain is also used to compute the projection onto source surfaces. Finally, the location of the inner nodes created during the decomposition process is computed by averaging the locations computed projecting from target and source surfaces.

An enhanced approach to automatic decomposition of thin-walled components for hexahedral-dominant meshing

“…The most useful and widely applied semi-automatic meshing technique is sweep meshing [5,[14][15][16], where a collection of quad mesh elements is swept from source faces to target faces. Much research has been developed to automatically decompose the model into sweepable sub-volumes [17][18][19][20].…”

Fun sheet matching: towards automatic block decomposition for hexahedral meshes

“…Because an automatic general all-hex solution that reliably produces high-quality elements for arbitrary geometries has not been developed, it is often necessary to follow a hand-made approach with software such as CUBIT [15] (mainly based on the sweeping algorithm [16][17][18]) or ICEM-CFD [19] (block-structured decomposition) where the user drives the hexahedral mesh generation by clever geometry decompositions. With such tools, the user must manually determine the relationship between the geometric features of the 3D objects and the hexahedral layers to form the final mesh.…”

“…17,18, and 19 provide some results obtained with the proposed algorithm. They show that the algorithm can deal with non-convex geometries having 4-valent geometric vertices.…”