Optimal multilevel iterative methods for adaptive grids
SIAM Journal on Scientific and Statistical Computing - Special issue on iterative methods in numerical linear algebra
A comparison of tetrahedron quality measures
Finite Elements in Analysis and Design
Local bisection refinement for N-simplicial grids generated by reflection
SIAM Journal on Scientific Computing
The 4-triangles longest-side partition of triangles and linear refinement algorithms
Mathematics of Computation
Locally Adapted Tetrahedral Meshes Using Bisection
SIAM Journal on Scientific Computing
Mesh quality improvement and other properties in the four-triangles longest-edge partition
Computer Aided Geometric Design
Fractality of refined triangular grids and space-filling curves
Engineering with Computers
Non-degeneracy study of the 8-tetrahedra longest-edge partition
Applied Numerical Mathematics
A geometric diagram and hybrid scheme for triangle subdivision
Computer Aided Geometric Design
Refinement based on longest-edge and self-similar four-triangle partitions
Mathematics and Computers in Simulation
Local refinement based on the 7-triangle longest-edge partition
Mathematics and Computers in Simulation
Local refinement based on the 7-triangle longest-edge partition
Mathematics and Computers in Simulation
An overview of procedures for refining triangulations
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Original article: A local refinement algorithm for the longest-edge trisection of triangle meshes
Mathematics and Computers in Simulation
Hi-index | 0.00 |
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.