Adaptive refinement of unstructured finite-element meshes
Finite Elements in Analysis and Design
Quality-improved local refinement of tetrahedral mesh based on element-wise refinement switching
Journal of Computational Physics
Mesh quality improvement and other properties in the four-triangles longest-edge partition
Computer Aided Geometric Design
The seven-triangle longest-side partition of triangles and mesh quality improvement
Finite Elements in Analysis and Design
Local refinement based on the 7-triangle longest-edge partition
Mathematics and Computers in Simulation
Non-degeneracy study of the 8-tetrahedra longest-edge partition
Applied Numerical Mathematics
Compatible triangulations and point partitions by series-triangular graphs
Computational Geometry: Theory and Applications
The propagation problem in longest-edge refinement
Finite Elements in Analysis and Design
Hi-index | 0.00 |
Abstract: In this paper we present a local refinement algorithm based on the longest-edge trisection of triangles. Local trisection patterns are used to generate a conforming triangulation, depending on the number of non-conforming nodes per edge presented. We describe the algorithm and provide a study of the efficiency (cost analysis) of the triangulation refinement problem. The algorithm presented, and its associated triangle partition, afford a valid strategy to refine triangular meshes. Some numerical studies are analysed together with examples of applications in the field of mesh refinement.