A distortion measure to validate and generate curved high-order meshes on CAD surfaces with independence of parameterization

This is the accepted version of the following article: [Gargallo-Peiró, A., Roca, X., Peraire, J., and Sarrate, J. (2016) A distortion measure to validate and generate curved high-order meshes on CAD surfaces with independence of parameterization. Int. J. Numer. Meth. Engng, 106: 1100–1130. doi: 10.1002/nme.5162], which has been published in final form at http://onlinelibrary.wiley.com/doi/10.1002/nme.5162/abstractA framework to validate and generate curved nodal high-order meshes on Computer-Aided Design (CAD) surfaces is presented. The proposed framework is of major interest to generate meshes suitable for thin-shell and 3D finite element analysis with unstructured high-order methods. First, we define a distortion (quality) measure for high-order meshes on parameterized surfaces that we prove to be independent of the surface parameterization. Second, we derive a smoothing and untangling procedure based on the minimization of a regularization of the proposed distortion measure. The minimization is performed in terms of the parametric coordinates of the nodes to enforce that the nodes slide on the surfaces. Moreover, the proposed algorithm repairs invalid curved meshes (untangling), deals with arbitrary polynomial degrees (high-order), and handles with low-quality CAD parameterizations (independence of parameterization). Third, we use the optimization procedure to generate curved nodal high-order surface meshes by means of an a posteriori approach. Given a linear mesh, we increase the polynomial degree of the elements, curve them to match the geometry, and optimize the location of the nodes to ensure mesh validity. Finally, we present several examples to demonstrate the features of the optimization procedure, and to illustrate the surface mesh generation process.Peer ReviewedPostprint (author's final draft

Generation of curved high-order meshes with optimal quality and geometric accuracy

We present a novel methodology to generate curved high-order meshes featuring optimal mesh quality and geometric accuracy. The proposed technique combines a distortion measure and a geometric L2-disparity measure into a single objective function. While the element distortion term takes into account the mesh quality, the L2-disparity term takes into account the geometric error introduced by the mesh approximation to the target geometry. The proposed technique has several advantages. First, we are not restricted to interpolative meshes and therefore, the resulting mesh approximates the target domain in a non-interpolative way, further increasing the geometric accuracy. Second, we are able to generate a series of meshes that converge to the actual geometry with expected rate while obtaining high-quality elements. Third, we show that the proposed technique is robust enough to handle real-case geometries that contain gaps between adjacent entities.Peer ReviewedPostprint (published version

Generation of Curved High-order Meshes with Optimal Quality and Geometric Accuracy

We present a novel methodology to generate curved high-order meshes featuring optimal mesh quality and geometric accuracy. The proposed technique combines a distortion measure and a geometric Full-size image (<1 K)-disparity measure into a single objective function. While the element distortion term takes into account the mesh quality, the Full-size image (<1 K)-disparity term takes into account the geometric error introduced by the mesh approximation to the target geometry. The proposed technique has several advantages. First, we are not restricted to interpolative meshes and therefore, the resulting mesh approximates the target domain in a non-interpolative way, further increasing the geometric accuracy. Second, we are able to generate a series of meshes that converge to the actual geometry with expected rate while obtaining high-quality elements. Third, we show that the proposed technique is robust enough to handle real-case geometries that contain gaps between adjacent entities.This research was partially supported by the Spanish Ministerio de Economía y Competitividad under grand contract CTM2014-55014-C3-3-R, and by the Government of Catalonia under grand contract 2014-SGR-1471. The work of the last author was supported by the European Commission through the Marie Sklodowska-Curie Actions (HiPerMeGaFlows project).Peer ReviewedPostprint (published version

A collocated finite volume scheme to solve free convection for general non-conforming grids

We present a new collocated numerical scheme for the approximation of the Navier-Stokes and energy equations under the Boussinesq assumption for general grids, using the velocity-pressure unknowns. This scheme is based on a recent scheme for the diffusion terms. Stability properties are drawn from particular choices for the pressure gradient and the non-linear terms. Numerical results show the accuracy of the scheme on irregular grids

Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes

We consider an algorithm called FEMWARP for warping triangular and tetrahedral finite element meshes that computes the warping using the finite element method itself. The algorithm takes as input a two- or three-dimensional domain defined by a boundary mesh (segments in one dimension or triangles in two dimensions) that has a volume mesh (triangles in two dimensions or tetrahedra in three dimensions) in its interior. It also takes as input a prescribed movement of the boundary mesh. It computes as output updated positions of the vertices of the volume mesh. The first step of the algorithm is to determine from the initial mesh a set of local weights for each interior vertex that describes each interior vertex in terms of the positions of its neighbors. These weights are computed using a finite element stiffness matrix. After a boundary transformation is applied, a linear system of equations based upon the weights is solved to determine the final positions of the interior vertices. The FEMWARP algorithm has been considered in the previous literature (e.g., in a 2001 paper by Baker). FEMWARP has been succesful in computing deformed meshes for certain applications. However, sometimes FEMWARP reverses elements; this is our main concern in this paper. We analyze the causes for this undesirable behavior and propose several techniques to make the method more robust against reversals. The most successful of the proposed methods includes combining FEMWARP with an optimization-based untangler.Comment: Revision of earlier version of paper. Submitted for publication in BIT Numerical Mathematics on 27 April 2010. Accepted for publication on 7 September 2010. Published online on 9 October 2010. The final publication is available at http://www.springerlink.co