Repositorio de producción científica de la Universidad de Sevilla

Local refinement based on the 7-triangle longest-edge partition

 

Advanced Search
 
Opened Access Local refinement based on the 7-triangle longest-edge partition
Cites

Show item statistics
Icon
Export to
Author: Plaza, Ángel
Márquez Pérez, Alberto
Moreno González, Auxiliadora
Suárez, José P.
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 2009
Published in: Mathematics and Computers in Simulation, 79 (8), 2444-2457.
Document type: Article
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. In this paper we specifically introduce a new local refinement for triangulations based on the longest-edge trisection, the 7-triangle longest-edge (7T-LE) local refinement algorithm. Each triangle to be refined is subdivided in seven sub-triangles by determining its longest edge. The conformity of the new mesh is assured by an automatic point insertion criterion using the oriented 1-skeleton graph of the triangulation and three partial division patterns.
Size: 1.301Mb
Format: PDF

URI: http://hdl.handle.net/11441/34686

DOI: http://dx.doi.org/10.1016/j.matcom.2009.01.009

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)