The quality improvement in mesh optimisation techniques that preserve its connectivity are
obtained by an iterative process in which each node of the mesh is moved to a new position …

Let $\mathcal {T} $ be a tetrahedral mesh. We present a 3-D local refinement algorithm for
$\mathcal {T} $ which is mainly based on an 8-subtetrahedron subdivision procedure, and …

In this paper we present a novel approach to the development of a class of local simplicial
refinement strategies. The algorithm in two dimensions first subdivides certain edges. Then …

The construction of changing sequences of irregular and nested triangulations, based on the
use of conforming refinement/derefinement algorithms for triangulations, is presented and …

A mesh generation approach that allows the local modification of meshes of simplices is
reviewed and discussed. The generation and modification of sequences of nested irregular …

We propose a new algorithm for constructing finite-element meshes suitable for spacetime
discontinuous Galerkin solutions of linear hyperbolic PDEs. Given a triangular mesh of some …

This paper introduces a new automatic strategy for adaptive tetrahedral mesh generation. A
local refinement/derefinement algorithm for nested triangulations and a simultaneous …

An adaptive strategy for three-dimensional time-dependent problems in the context of the
FEM is presented. The basic tools are a mechanism for local refinement and coarsening of …

Mesh generation is a great example of inter-disciplinary research. Its development is built
upon advances in computational and combinatorial geometry, data structures, numerical …

A generalized procedure of bisection of $ n $–simplices is introduced, where the bisection
point can be an (almost) arbitrary point at one of the longest edges. It is shown that nested …