There are simple and robust refinements (almost) as good as Delaunay

A new edge-based partition for triangle meshes is presented, the Seven Triangle Quasi-Delaunay partition (7T-QD). The proposed partition joins together ideas of the Seven Triangle Longest-Edge partition (7T-LE), and the classical criteria for constructing Delaunay meshes. The new partition performs similarly compared to the Delaunay triangulation (7T-D) with the benefit of being more robust and with a cheaper cost in computation. It will be proved that in most of the cases the 7T-QD is equal to the 7T-D. In addition, numerical tests will show that the difference on the minimum angle obtained by the 7T-QD and by the 7T-D is negligible

An insight into the science of unstructured meshes in computer numerical simulation

Computer numerical simulation is a beneficial tool for studying various domains of knowledge. Among the steps in the whole process of numerical simulation is the generation of unstructured meshes. Since the unstructured meshes are usually generated using automatic software, the fundamental knowledge of the unstructured meshes is often neglected. This paper highlighted some useful insights into the unstructured meshes in numerical simulation for several application domains, such as the radiative heat transfer problem, ocean modelling and biomedical engineering. It also reviewed some fundamental concepts and frameworks for element generation in producing unstructured meshes, particularly the Delaunay triangulation and advancing front techniques