Mesh quality improvement and other properties in the four-triangles longest-edge partition

The four-triangles longest-edge (4T-LE) partition of a triangle t is obtained by joining the midpoint of the longest edge of t to the opposite vertex and to the midpoints of the two remaining edges. The so-called self-improvement property of the refinement algorithm based on the 4-triangles longest-edge partition is discussed and delimited by studying the number of dissimilar triangles arising from the 4T-LE partition of an initial triangle and its successors. In addition, some geometrical properties such as the number of triangles in each similarity class per mesh level and new bounds on the maximum of the smallest angles and on the second largest angles are deduced.

[1]  Subodh Kumar Robust Incremental Polygon Triangulation for Fast Surface Rendering , 2000, WSCG.

[2]  Douglas N. Arnold,et al.  Locally Adapted Tetrahedral Meshes Using Bisection , 2000, SIAM Journal on Scientific Computing.

[3]  Fan Wu,et al.  A Developer's Survey of Polygonal Simplification algorithms , 2005 .

[4]  María Cecilia Rivara,et al.  Terminal-edges Delaunay (small-angle based) algorithm for the quality triangulation problem , 2001, Comput. Aided Des..

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

[6]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

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

[8]  Piotr Breitkopf,et al.  Simultaneous surface and tetrahedron mesh adaptation using mesh‐free techniques , 2003 .

[9]  William F. Mitchell,et al.  Optimal Multilevel Iterative Methods for Adaptive Grids , 1992, SIAM J. Sci. Comput..

[10]  Eberhard Bänsch,et al.  Local mesh refinement in 2 and 3 dimensions , 1991, IMPACT Comput. Sci. Eng..

[11]  Nancy Hitschfeld,et al.  Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms , 2003 .

[12]  Joseph M. Maubach,et al.  Local bisection refinement for $n$-simplicial grids generated by reflection , 2017 .

[13]  B. G. Prakash,et al.  Geometry based triangulation of multiple trimmed NURBS surfaces , 2001, Comput. Aided Des..

[14]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[15]  Bernd Hamann,et al.  Piecewise optimal triangulation for the approximation of scattered data in the plane , 2000, Comput. Aided Geom. Des..

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

[17]  María Cecilia Rivara,et al.  The 4-triangles longest-side partition of triangles and linear refinement algorithms , 1996, Math. Comput..

[18]  D. Du,et al.  Computing in Euclidean Geometry , 1995 .