A bisection method for systems of nonlinear equations
ACM Transactions on Mathematical Software (TOMS)
On the shape of tetrahedra from bisection
Mathematics of Computation
Local bisection refinement for N-simplicial grids generated by reflection
SIAM Journal on Scientific Computing
Quality local refinement of tetrahedral meshes based on bisection
SIAM Journal on Scientific Computing
The 4-triangles longest-side partition of triangles and linear refinement algorithms
Mathematics of Computation
On generalized bisection of n-simplices
Mathematics of Computation
Locally Adapted Tetrahedral Meshes Using Bisection
SIAM Journal on Scientific Computing
On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
Computers & Mathematics with Applications
Lepp-bisection algorithms, applications and mathematical properties
Applied Numerical Mathematics
Hi-index | 7.29 |
We examine a generalized conforming bisection (GCB-)algorithm which allows both global and local nested refinements of the triangulations without generating hanging nodes. It is based on the notion of a mesh density function which prescribes where and how much to refine the mesh. Some regularity properties of generated sequences of refined triangulations are proved. Several numerical tests demonstrate the efficiency of the proposed bisection algorithm. It is also shown how to modify the GCB-algorithm in order to generate anisotropic meshes with high aspect ratios.