Computer Methods in Applied Mechanics and Engineering
On the maximum angle condition for linear tetrahedral elements
SIAM Journal on Numerical Analysis
GrAL - The Grid Algorithms Library
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Efficient Implementation of Operators on Semi-unstructured Grids
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Selective edge removal for unstructured grids with Cartesian cores
Journal of Computational Physics
GrAL: the grid algorithms library
Future Generation Computer Systems
GrAL-the grid algorithms library
Future Generation Computer Systems
| Hi-index | 0.00 |
We present a novel automatic grid generator for the finite element discretization of partial differential equations in 3D. The grids constructed by this grid generator are composed of a pure tensor product grid in the interior of the domain and an unstructured grid which is only contained in boundary cells. The unstructured component consists of tetrahedra, each of which satisfies a maximal interior angle condition. By suitable constructing the boundary cells, the number of types of boudary subcells is reduced to 12 types. Since this grid generator constructs large structured grids in the interior and small unstructured grids near the boundary, the resulting semi-unstructured gids have similar properties as structured tensor product grids. Some appealing properties of this method are computational efficiency and natural construction of coarse grids for multilevel algorithms. Numerical results and an analysis of the discretization error are presented.