A recursive approach to local mesh refinement in two and three dimensions

AbstractThe newest vertex strategy for local refinement in two dimensions is reviewed and discussed. A recursive algorithm for local refinement of tetrahedral meshes in three dimensions based on similar bisection strategy is described. The recursive approach requires certain restrictions on the initial mesh. On the other hand, under this condition, the refinement process can be kept as local as needed, and it can be fully inverted. Simple data structures and derefinement algorithms are also outlined