Abstract
In this work we propose a strategy for red-type refinements of tetrahedra which produces families of face-to-face tetrahedral partitions satisfying the maximum angle condition, a highly desired property in mesh generation, interpolation theory and finite element analysis.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bey, J.: Simplicial grid refinement: on Freudenthal’s algorithm and the optimal number of congruence classes. Numer. Math. 85, 1–29 (2000)
Cheng, S.W., Dey, T.K., Edelsbrunner, H., Facello, M.A., Teng, S.H.: Sliver exudation. In: Proceedings of the 15th ACM Symposium on Computational Geometry, pp. 1–13 (1999)
Ciarlet, P.G.: The Finite Element Method for Elliptic Problems. North-Holland, Amsterdam (1978)
Edelsbrunner, H.: Triangulations and meshes in computational geometry. Acta Numer. 9, 133–213 (2000)
Eriksson, F.: The law of sines for tetrahedra and \(n\)-simplices. Geom. Dedicata. 7, 71–80 (1978)
Grande, J.: Red-green refinement of simplicial meshes in \(d\) dimensions. Math. Comput. 88, 751–782 (2019)
Hannukainen, A., Korotov, S., Křížek, M.: The maximum angle condition is not necessary for convergence of the finite element method. Numer. Math. 120, 79–88 (2012)
Hannukainen, A., Korotov, S., Křížek, M.: Generalizations of the Synge-type condition in the finite element method. Appl. Math. 62, 1–13 (2017)
Khademi, A., Korotov, S., Vatne, J.E.: On the generalization of the Synge-Křížek maximum angle condition for \(d\)-simplices. J. Comput. Appl. Math. 358, 29–33 (2019)
Korotov, S., Křížek, M.: Red refinements of simplices into congruent subsimplices. Comput. Math. Appl. 67, 2199–2204 (2014)
Korotov, S., Plaza, Á., Suárez, J.: Longest-edge \(n\)-section algorithms: properties and open problems. J. Comput. Appl. Math. 293, 139–146 (2016)
Křížek, M.: An equilibrium finite element method in three-dimensional elasticity. Aplikace Matematiky 27, 46–75 (1982)
Křížek, M.: On the maximum angle condition for linear tetrahedral elements. SIAM J. Numer. Anal. 29, 513–520 (1992)
Křížek, M., Strouboulis, T.: How to generate local refinements of unstructured tetrahedral meshes satisfying a regularity ball condition. Numer. Methods Partial Differ. Equ. 13, 201–214 (1997)
Ong, M.E.G.: Uniform refinement of a tetrahedron. SIAM J. Sci. Comput. 15, 1134–1144 (1994)
Zhang, S.: Successive subdivisions of tetrahedra and multigrid methods on tetrahedral meshes. Houston J. Math. 21, 541–556 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Korotov, S., Vatne, J.E. (2020). On Regularity of Tetrahedral Meshes Produced by Some Red-Type Refinements. In: Pinelas, S., Graef, J.R., Hilger, S., Kloeden, P., Schinas, C. (eds) Differential and Difference Equations with Applications. ICDDEA 2019. Springer Proceedings in Mathematics & Statistics, vol 333. Springer, Cham. https://doi.org/10.1007/978-3-030-56323-3_49
Download citation
DOI: https://doi.org/10.1007/978-3-030-56323-3_49
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-56322-6
Online ISBN: 978-3-030-56323-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)