A 3‐D refinement algorithm suitable for adaptive and multi‐grid techniques
- 1 May 1992
- journal article
- research article
- Published by Wiley in Communications in Applied Numerical Methods
- Vol. 8 (5) , 281-290
- https://doi.org/10.1002/cnm.1630080502
Abstract
A 3‐D refinement algorithm for tetrahedral meshes is presented and discussed. An empirical study of the reduction of solid angle size due to repeated subdivisions has shown the algorithm to be in practice a powerful and reliable tool for mesh refinement suitable to be combined with adaptive finite‐element methods and multi‐grid algorithms.Keywords
This publication has 3 references indexed in Scilit:
- Selective refinement/derefinement algorithms for sequences of nested triangulationsInternational Journal for Numerical Methods in Engineering, 1989
- Multi-Grid Methods and ApplicationsPublished by Springer Nature ,1985
- Algorithms for refining triangular grids suitable for adaptive and multigrid techniquesInternational Journal for Numerical Methods in Engineering, 1984