Applications of mesh adaption techniques could be found in the numerical solution of PDE’s or in the optimal triangulation of surfaces for shape representation or graphic display. The scope of this work is to verify through numerical experiments the effectiveness of some algorithms for the control of the L∞ error norm for piece–wise linear approximation on 2D unstructured triangular meshes. The...

We propose a method for generating well-shaped curved unstructured meshes using a nonlinear elasticity analogy. The geometry of the domain to be meshed is represented as an elastic solid. The undeformed geometry is the initial mesh of linear triangular or tetrahedral elements. The external loading results from prescribing a boundary displacement to be that of the curved geometry, and the final ...

A conservative primitive variable discrete exterior calculus (DEC) discretization of the Navier–Stokes equations is performed. An existing DEC method [M. S. Mohamed, A. N. Hirani, and R. Samtaney, “Discrete incompressible over surface simplicial meshes,” J. Comput. Phys. 312, 175–191 (2016)] modified to this end extended include energy-preserving time integration Coriolis force enhance its appl...

ADER schemes are recent finite volume methods for hyperbolic conservation laws, which can be viewed as generalizations of the classical first order Godunov method to arbitrary high orders. In the ADER approach, high order polynomial reconstruction from cell averages is combined with high order flux evaluation, where the latter is done by solving generalized Riemann problems across cell interfac...

We present an unstructured triangular mesh generation algorithm that approximates a set of mutually nonintersecting simple trimmed polynomial parametric surface patches within a user specified geometric tolerance. The proposed method uses numerically robust interval geometric representations/computations and also addresses the problem of topological consistency (homeomorphism) between the exact...

We present an unstructured triangular mesh generation algorithm that approximates a set of mutually non-intersecting simple trimmed rational B-spline surface patches within a user speciied geometric tolerance. The proposed method uses numerically robust interval geometric representations/computations and also addresses the problem of topological consistency (homeomorphism) between the exact geo...

We present an unstructured triangular mesh generation algorithm that approximates a set of mutually non-intersecting simple trimmed rational B-spline surface patches within a user specified geometric tolerance. The proposed method uses numerically robust interval geometric representations/computations and also addresses the problem of topological consistency (homeomorphism) between the exact ge...

Abstract. In this paper, a method for adapting existing 2D and 3D unstructured meshes to modified domain boundaries is presented. The method simultaneously employs mesh smoothing, moving and untangling. It should be considered as an alternative to mesh regeneration often used in either optimization or unsteady flow computations with moving boundaries. With respect to the widely used Laplacian s...