To access the full text documents, please follow this link:

A new procedure to compute imprints in multi-sweeping algorithms
Ruiz-Gironés, Eloi; Roca Navarro, Francisco Javier; Sarrate Ramos, Josep
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
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.
Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica::Mètodes en elements finits
Finite element method
Numerical grid generation
Finite element methodMesh generationHexahedral meshMultisweepingComputational domain
Elements finits, Mètode dels
Open Access
Conference Object

Show full item record