The 4-triangles longest-side partition of triangles and linear refinement algorithms

In this paper we study geometrical properties of the iterative 4-triangles longest-side partition of triangles (and of a 3-triangles partition), as well as practical algorithms based on these partitions, used both directly for the triangulation refinement problem, and as a basis for point insertion strategies in Delaunay refinement algorithms. The 4-triangles partition is obtained by joining the midpoint of the longest side with the opposite vertex and the midpoints of the two remaining sides. By means of simple geometrical arguments we show that the iterative partition of obtuse triangles systematically improves the triangles (while they remain obtuse) in the following sense: the sequence of smallest angles monotonically increases while the sequence of largest angles monotonically decreases in an amount (at least) equal to the smallest angle of each iteration. This allows us to improve the known bound on the smallest angle (without making use of previous results), and to obtain a better a priori bound on the number of similarly distinct triangles, as a function of the geometry of the initial triangle. Numerical evidence, showing that the practical behavior of the 4-triangles partition is in complete agreement with this theory, is included. A 4-triangles refinement algorithm is also discussed and illustrated. Furthermore, we show that the time cost of the algorithm is linear independently of the size of the triangulation.

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

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

[3]  Wolfgang Hackbusch,et al.  Multi-grid methods and applications , 1985, Springer series in computational mathematics.

[4]  J. Penman,et al.  Self-adaptive mesh generation technique for the finite-element method , 1987 .

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

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

[7]  M. Stynes.  On faster convergence of the bisection method for certain triangles , 1979 .

[8]  Roy Williams,et al.  Adaptive Parallel Meshes with Complex Geometry , 1991 .

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

[10]  María Cecilia Rivara.  A Discussion on the Triangulation Refinement Problem , 1993, CCCG.

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

[12]  Kent L. Lawrence,et al.  Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes , 1995 .

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

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

[15]  Ivo Babuška,et al.  Accuracy estimates and adaptive refinements in finite element computations , 1986 .