## Abstract Adaptive refinement of finite element approximations on tetrahedral meshes is generally considered to be a nonβtrivial task. (We wish to stress that this paper deals with mesh __refinement__ as opposed to __remeshing__.) The splitting of individual finite elements needs to be done with
Optimization of tetrahedral meshes based on element shape measures
β Scribed by S.H. Lo
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 924 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0045-7949
No coin nor oath required. For personal study only.
β¦ Synopsis
An element shape optimization procedure is presented, which can be considered as a general post-treatment process for three-dimensional tetrahedral meshes generated by Delaunay triangulation or refinement based on the subdivision of elements. The tetrahedral mesh is optimized with respect to a given element shape measure through a combined iterative scheme of local transformations and node relaxation.
From the examples studied, a substantial gain in quality could be achieved in two cycles of iterations based on any valid shape measures, minimum solid angle 8, radius ratio p and gamma coefficient y. Although further research and evidence are required for a more definite conclusion, the y-coefficient which is more economical to compute, seems to give better results than the other two shape measures. The largest mesh processed which, consists of 67,326 nodes and 360,824 elements, required a CPU time of a little more than 3 min on a IBM Power Station 3BT.
π SIMILAR VOLUMES