Local refinement of simplicial grids based on the skeleton
A new algorithm for the local refinement of simplicial grids in two and three dimensions is described. The complexity is linear in the number of added nodes. The algorithm is fully automatic and numerical results show that subtetrahedra are not too badly degenerated.
scientific article; zbMATH DE number 1398457