Article
Local refinement based on the 7-triangle longest-edge partition
Author/s | 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) |
Publication Date | 2009 |
Deposit Date | 2016-02-12 |
Published in |
|
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 ... 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. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Local refinement.pdf | 1.301Mb | [PDF] | View/ | |