Abstract

This paper presents a new algorithm to map a given mesh over a source surface onto a target surface. This projection is determined by means of a least-squares approximation of a transformation defined between the loops of boundary nodes of the cap surfaces in the parametric spaces. Once the new mesh is obtained on the parametric space of the target surface, it is mapped to the target surface according to its parameterization. Therefore, in contrast with the usual techniques, the developed algorithm does not require solving any root finding problem to ensure that the projected nodes are on the target surface. Finally, this projection algorithm is extended to three-dimensional cases and included in a sweep meshing tool in order to generate the inner layers of elements in the physical space.

Abstract

This paper presents a new algorithm to generate hexahedral meshes in extrusion geometries. Several algorithms have been devised to generate hexahedral meshes by projecting the cap surfaces along a sweep path. In all of these algorithms the crucial step is the placement of the inner layer of nodes. That is, the projection of the source surface mesh along the sweep path. From the computational point of view, sweep methods based on a least-squares approximation of an affine mapping are the fastest alternative to compute these projections. Several functionals have been introduced to perform the least-squares approximation. However, for very simple and typical geometrical configurations they may generate low-quality projected meshes. For instance, they may induce skewness and flattening effects on the projected discretizations. In addition, for these configurations the minimization of these functionals may lead to a set of normal equations with singular system matrix. In this work we analyze previously defined functionals. Based on this analysis we propose a new functional and show that its minimization overcomes these drawbacks. Finally, we present several examples to assess the properties of the proposed functional.