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 refinement problem: the known longest-side (triangle bisection) refinement algorithm, as well as a new algorithm that uses longest side bisection techniques for refining 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. © 1997 by John Wiley & Sons, Ltd.

[1]  F. Stenger,et al.  A lower bound on the angles of triangles constructed by bisecting the longest side , 1975 .

[2]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[3]  M. Rivara.  Mesh Refinement Processes Based on the Generalized Bisection of Simplices , 1984 .

[4]  M. Rivara.  Algorithms for refining triangular grids suitable for adaptive and multigrid techniques , 1984 .

[5]  María Cecilia Rivara,et al.  Design and data structure of fully adaptive, multigrid, finite-element software , 1984, ACM Trans. Math. Softw..

[6]  L. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi , 1985, TOGS.

[7]  M. Rivara.  A grid generator based on 4‐triangles conforming mesh‐refinement algorithms , 1987 .

[8]  S. Sloan.  A fast algorithm for constructing Delaunay triangulations in the plane , 1987 .

[9]  M. Rivara.  Selective refinement/derefinement algorithms for sequences of nested triangulations , 1989 .

[10]  Sung-Chin Hahn,et al.  A three dimensional adaptive finite element method for magnetostatic problems , 1991 .

[11]  Paul Dierckx,et al.  Algorithms for surface fitting using Powell-Sabin splines , 1992 .

[12]  Graham F. Carey,et al.  Mesh generation/refinement using fractal concepts and iterated function systems , 1992 .

[13]  M. Rivara,et al.  A 3-D refinement algorithm suitable for adaptive and multi-grid techniques , 1992 .

[14]  Kent L. Lawrence,et al.  An algorithm for adaptive refinement of triangular element meshes , 1993 .

[15]  Joseph O'Rourke.  Computational geometry column 23 , 1994, Int. J. Comput. Geom. Appl..

[16]  Mark T. Jones,et al.  New techniques for parallel simulation of high-temperature superconductors , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.