Locally Adapted Tetrahedral Meshes Using Bisection
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 22 (2) , 431-448
- https://doi.org/10.1137/s1064827597323373
Abstract
We present an algorithm for the construction of locally adapted conformal tetrahedral meshes. The algorithm is based on bisection of tetrahedra. A new data structure is introduced, which simplifies both the selection of the refinement edge of a tetrahedron and the recursive refinement to conformity of a mesh once some tetrahedra have been bisected. We prove that repeated application of the algorithm leads to only finitely many tetrahedral shapes up to similarity, and we bound the amount of additional refinement that is needed to achieve conformity. Numerical examples of the effectiveness of the algorithm are presented.Keywords
This publication has 8 references indexed in Scilit:
- Tetrahedral grid refinementComputing, 1995
- Quality Local Refinement of Tetrahedral Meshes Based on BisectionSIAM Journal on Scientific Computing, 1995
- Local Bisection Refinement for N-Simplicial Grids Generated by ReflectionSIAM Journal on Scientific Computing, 1995
- On the shape of tetrahedra from bisectionMathematics of Computation, 1994
- A 3‐D refinement algorithm suitable for adaptive and multi‐grid techniquesCommunications in Applied Numerical Methods, 1992
- Local mesh refinement in 2 and 3 dimensionsIMPACT of Computing in Science and Engineering, 1991
- Local modification of meshes for adaptive and/or multigrid finite-element methodsJournal of Computational and Applied Mathematics, 1991
- On the bisection method for trianglesMathematics of Computation, 1983