|Title:||Refinement based on longest-edge and self-similar four-triangle partitions||Authors:||Padrón, Miguel A.
Suárez, José P.
|UNESCO Clasification:||120601 Construcción de algoritmos||Keywords:||Mesh quality
Longest-edge based algorithms
|Issue Date:||2007||Journal:||Mathematics and Computers in Simulation||Conference:||4th Conference on Applied Scientific Computing and Tools, Grid Generation, Approximation and Visualization||Abstract:||The triangle longest-edge bisection constitutes an efficient scheme for refining a mesh by reducing the obtuse triangles, since the largest interior angles are subdivided. One of these schemes is the four-triangle longest-edge (4T-LE) partition. Moreover, the four triangle self-similar (4T-SS) partition of an acute triangle yields four sub-triangles similar to the original one. In this paper we present a hybrid scheme combining the 4T-LE and the 4T-SS partitions which use the longest-edge based refinement. Numerical experiments illustrate improvement in angles and quality. The benefits of the algorithm suggest its use as an efficient tool for mesh refinement in the context of Finite Element computations.||URI:||http://hdl.handle.net/10553/54426||ISSN:||0378-4754||DOI:||10.1016/j.matcom.2006.12.010||Source:||Mathematics and Computers in Simulation [ISSN 0378-4754], v. 75, p. 251-262|
|Appears in Collections:||Artículos|
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.