Convergence Speed of Generalized Longest-Edge-Based Refinement
In the refinement of meshes, one wishes to iteratively subdivide a domain following geometrical partition rules. The aim is to obtain a new discretized domain with adapted regions. We prove that the Longest Edge \(n\)-section of triangles for \(n\geqslant 4\) produces a finite sequence of triangle meshes with guaranteed convergence of diameters and review previous result when \(n\) equals 2 and 3. We give upper and lower bounds for the convergence speed in terms of diameter reduction. Then we fill the gap in the analysis of the diameters convergence for generalized Longest Edge based refinement. In addition, we give a numerical study for the case of \(n=4\), the so-called LE quatersection, evidencing its utility in adaptive mesh refinement.
KeywordsDiameter Longest-edge Mesh refinement \(n\)-section Refinement Triangulation Triangle partition
- 1.Carey GF (1997) Computational grids: generation, adaptation, and solution strategies. Taylor & Francis, BristolGoogle Scholar
- 6.Perdomo F, Plaza A, Quevedo E, Suárez JP (2011) A lower bound on the angles of triangles constructed by LE-trisection. In: Proceedings of XIV Spanish meeting on computational geometry, pp 201–204Google Scholar
- 12.Perdomo F, Plaza A, Quevedo E, Suárez JP (2012) A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection. Math Comput Simulat (in review)Google Scholar
- 13.Suárez JP, Moreno T, Abad P, Plaza A (2012) Convergence speed of longest edge n-section of triangles. Lecture notes in engineering and computer science: proceedings of world congress on engineering, WCE 2012, London, UK, 4–6 July 2012, pp 869–873Google Scholar