Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/54467
Title: The seven-triangle longest-side partition of triangles and mesh quality improvement
Authors: Márquez, Alberto
Moreno-González, Auxiliadora
Plaza, Ángel 
Suárez, José P. 
UNESCO Clasification: 120601 Construcción de algoritmos
Keywords: Refinement
Longest-edge based algorithms
Improvement of mesh quality
Issue Date: 2008
Journal: Finite Elements in Analysis and Design 
Abstract: A new triangle partition, the seven-triangle longest-edge partition, based on the trisection of the edges is presented and the associated mesh quality improvement property, discussed. The seven-triangle longest-edge (7T-LE) partition of a triangle t is obtained by putting two equally spaced points per edge. After cutting off three triangles at the corners, the remaining hexagon is subdivided further by joining each point of the longest-edge of t to the base points of the opposite sub-triangle. Finally, the interior quadrangle is subdivided into two sub-triangles by the shortest diagonal. The self-improvement property of the 7T-LE partition is discussed, delimited and compared to the parallel property of the four-triangle longest-edge (4T-LE) partition. Global refinement strategies, combining longest-edge with self-similar partitions, are proposed, based on the theoretical geometrical properties.
URI: http://hdl.handle.net/10553/54467
ISSN: 0168-874X
DOI: 10.1016/j.finel.2008.04.007
Source: Finite Elements in Analysis and Design [ISSN 0168-874X], v. 44, p. 748-758
Appears in Collections:Artículos
Show full item record

SCOPUSTM   
Citations

10
checked on Aug 1, 2021

WEB OF SCIENCETM
Citations

7
checked on Aug 1, 2021

Page view(s)

35
checked on Jul 31, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.