Optimal multilevel iterative methods for adaptive grids
SIAM Journal on Scientific and Statistical Computing - Special issue on iterative methods in numerical linear algebra
Local bisection refinement for N-simplicial grids generated by reflection
SIAM Journal on Scientific Computing
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
The 4-triangles longest-side partition of triangles and linear refinement algorithms
Mathematics of Computation
Piecewise optimal triangulation for the approximation of scattered data in the plane
Computer Aided Geometric Design
Concrete Math
Locally Adapted Tetrahedral Meshes Using Bisection
SIAM Journal on Scientific Computing
A Developer's Survey of Polygonal Simplification Algorithms
IEEE Computer Graphics and Applications
The 8-tetrahedra longest-edge partition of right-type tetrahedra
Finite Elements in Analysis and Design
The propagation problem in longest-edge refinement
Finite Elements in Analysis and Design
Block-balanced meshes in iterative uniform refinement
Computer Aided Geometric Design
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
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
The propagation problem in longest-edge refinement
Finite Elements in Analysis and Design
The 8-tetrahedra longest-edge partition of right-type tetrahedra
Finite Elements in Analysis and Design
Four-triangles adaptive algorithms for RTIN terrain meshes
Mathematical and Computer Modelling: An International Journal
Original article: A local refinement algorithm for the longest-edge trisection of triangle meshes
Mathematics and Computers in Simulation
Hi-index | 0.00 |
The four-triangles longest-edge (4T-LE) partition of a triangle t is obtained by joining the midpoint of the longest edge of t to the opposite vertex and to the midpoints of the two remaining edges. The so-called self-improvement property of the refinement algorithm based on the 4-triangles longest-edge partition is discussed and delimited by studying the number of dissimilar triangles arising from the 4T-LE partition of an initial triangle and its successors. In addition, some geometrical properties such as the number of triangles in each similarity class per mesh level and new bounds on the maximum of the smallest angles and on the second largest angles are deduced.