A Flexible Unstructured Mesh Generation Algorithm Suitable for Block Partitioning
Karamete, B. Kaan
5th International Conference on Numerical Grid Generation in Computational Field Simulations, Mississippi State University, pp.279-289, April 1996
This paper describes the logic of a dynamic algorithm for an arbitrarily prescribed geometry. The generated meshes show Delaunay property both in 2D and 3D. The algorithm requires minimal surface information in 3D. The surface triangles appear as the direct result of interior tetrahedron. The adopted successive refinement scheme results in such a node distribution that it is not needed to check boundary conformity. Further computational saving is provided by using a special binary tree (ADT). The generating front can be determined a-priori as opposed to the moving front techniques. This technique can be used to effectively partition the geometry into equal element sized blocks while generating the mesh for parallel computing purposes. The algorithm shows flexibility to split the geometry into blocks at mesh generation time.
Contact author(s) or publisher for availability and copyright information on above referenced article