Stability of the 8-tetrahedra shortest-interior-edge partitioning method
- First Online:
We consider a tetrahedron partitioning method, known in the literature as the 8-tetrahedra shortest-interior-edge partition. For this method, which is a variant of Freudenthal’s algorithm in three space dimensions, we prove that the infinite series of refined meshes (for any given initial mesh) is stable in the sense that the degree of degeneracy of the cells remains bounded. We give an explicit estimate in terms of a standard shape quality measure introduced by Liu and Joe. Furthermore, we show that our estimate is sharp. The estimate also holds for Freudenthal’s algorithm (in three space dimensions) provided that it is initialized appropriately. Numerical experiments confirm our result as well as its sharpness.
Mathematics Subject Classification (2000)65N50
Unable to display preview. Download preview PDF.
- 1.Bank, R., Sherman, A., Weiser, A.: Refinement algorithms and data structures for regular local mesh refinement. In: Stepleman, R. (ed.) Scientific Computing, pp. 3–17. North-Holland, Amsterdam (1983)Google Scholar