Parallel mesh generation is a relatively new research area between the boundaries of two
scientific computing disciplines: computational geometry and parallel computing. In this …

A numerical method for 2D LEFM crack propagation simulation is presented. This uses a
Lepp–Delaunay based mesh refinement algorithm for triangular meshes which allows both …

The terminal-edge Delaunay algorithm, initially called Lepp–Delaunay algorithm, deals with
the construction of size-optimal (adapted to the geometry) quality triangulation of complex …

Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to
produce hierarchies of quality and nested irregular triangulations as needed both for …

Level set methods offer highly robust and accurate methods for detecting interfaces of
complex structures. Efficient techniques are required to transform an interface to a globally …

We discuss an innovative, simple and effective Lepp terminal-star algorithm for improving
tetrahedral meshes. For each bad quality tetrahedron, one branch of the longest edge …

A method, mesh data structure and apparatus is disclosed for producing an
improved/refined/derefined mesh of finite elements for a three-dimensional object showing …

We discuss Lepp-centroid versus Lepp-midpoint algorithms for Delaunay quality
triangulation. We present geometrical results that ensure that the centroid version produces …

We present a practical and stable algorithm for the parallel refinement of tetrahedral
meshes. The algorithm is based on the refinement of terminal-edges and associated …

In this paper, we provide proofs of termination and size-optimality of the LEPP-Delaunay
algorithm, for the quality generation of triangulations. We first prove that the algorithm cannot …