Two triangulations methods based on edge refinement

In this paper two curvature adaptive methods of surface triangulation are presented. Both methods are based on edge refinement to obtain a triangulation compatible with the curvature requirements. The first method applies an incremental and constrained Delaunay triangulation and uses curvature bounds to determine if an edge of the triangulation is admissible. The second method uses this function also in the edge refinement process, i.e. in the computation of the location of a refining point, and in the re-triangulation needed after the insertion of this refining point. Results are presented, comparing both approachesPostprint (published version

Recent advances in unstructured grid generation program VGRID3D

A program for the generation of unstructured grids over complex configurations, VGRID3D, is described. The grid elements (triangles on the surfaces and tetrahedra in the field) are generated starting from the surface boundaries towards the interior of the computational domain using the Advancing Front Method

Three-dimensional unstructured grid generation via incremental insertion and local optimization

Algorithms for the generation of 3D unstructured surface and volume grids are discussed. These algorithms are based on incremental insertion and local optimization. The present algorithms are very general and permit local grid optimization based on various measures of grid quality. This is very important; unlike the 2D Delaunay triangulation, the 3D Delaunay triangulation appears not to have a lexicographic characterization of angularity. (The Delaunay triangulation is known to minimize that maximum containment sphere, but unfortunately this is not true lexicographically). Consequently, Delaunay triangulations in three-space can result in poorly shaped tetrahedral elements. Using the present algorithms, 3D meshes can be constructed which optimize a certain angle measure, albeit locally. We also discuss the combinatorial aspects of the algorithm as well as implementational details

Accurate multigrid solution of the Euler equations on unstructured and adaptive meshes

A method for accurately solving inviscid compressible flow in the subcritical and supercritical regimes about complex configurations is presented. The method is based on the use of unstructured triangular meshes in two dimensions, and special emphasis is placed on the accuracy and efficiency of the solutions. High accuracy is achieved by careful scaling of the artificial dissipation terms, and by reformulating the inner and outer boundary conditions for both the convective and dissipative operators. An adaptive grid refinement strategy is presented which enhances the solution accuracy for complex flows. When coupled with an unstructured multigrid algorithm, this method is shown to produce an efficient solver for flows about arbitrary configurations

Geometric Error of Finite Volume Schemes for Conservation Laws on Evolving Surfaces

This paper studies finite volume schemes for scalar hyperbolic conservation laws on evolving hypersurfaces of $\mathbb{R}^3$. We compare theoretical schemes assuming knowledge of all geometric quantities to (practical) schemes defined on moving polyhedra approximating the surface. For the former schemes error estimates have already been proven, but the implementation of such schemes is not feasible for complex geometries. The latter schemes, in contrast, only require (easily) computable geometric quantities and are thus more useful for actual computations. We prove that the difference between approximate solutions defined by the respective families of schemes is of the order of the mesh width. In particular, the practical scheme converges to the entropy solution with the same rate as the theoretical one. Numerical experiments show that the proven order of convergence is optimal.Comment: 23 pages, 5 figures, to appear in Numerische Mathemati

Multigrid solution of the Euler equations on unstructured and adaptive meshes

A multigrid algorithm has been developed for solving the steady-state Euler equations in two dimensions on unstructured triangular meshes. The method assumes the various coarse and fine grids of the multigrid sequence to be independent of one another, thus decoupling the grid generation procedure from the multigrid algorithm. The transfer of variables between the various meshes employs a tree-search algorithm which rapidly identifies regions of overlap between coarse and fine grid cells. Finer meshes are obtained either by regenerating new globally refined meshes, or by adaptively refining the previous coarser mesh. For both cases, the observed convergence rates are comparable to those obtained with structured multigrid Euler solvers. The adaptively generated meshes are shown to produce solutions of higher accuracy with fewer mesh points