A review on delaunay refinement techniques

Abstract

Delaunay refinement is a technique for generating triangulations. Triangulations produced by algorithms in this class of techniques guarantee bounds on angles, edge lengths, the number and the grading of triangles in theory and practice. This paper is a brief review of point insertion techniques in Delaunay triangulations. Important works on the insertion of vertices in Delaunay triangulations and its dual graph, the Voronoi diagram, are described as a start point for one who needs to build a quality mesh using adaptive triangular-mesh refinement.