USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS

In this paper we discuss, study and compare two linear algorithms for the triangulation re nement problem: the known longest-side (triangle bisection) re nement algorithm, as well as a new algorithm that uses longest side bisection techniques for re ning Delaunay triangulations. We show that the automatic point insertion criterion, taken from the fractal property of optimal (linear) longest-side bisection algorithms, assures the construction of good quality Delaunay triangulations in linear time. Numerical evidence, showing that the practical behaviour of the new algorithm is in complete agreement with the theory, is included.