The seven-triangle longest-side partition of triangles and mesh quality improvement
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 p...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2008 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/111846 |
| Acceso en línea: | https://hdl.handle.net/11441/111846 https://doi.org/10.1016/j.finel.2008.04.007 |
| Access Level: | acceso abierto |
| Palabra clave: | Refinement Longest-edge based algorithms Improvement of mesh quality |
| Sumario: | 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. |
|---|