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 consequence of interior tetrahedration. 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 not be determined a-priori as opposed to the moving front techniques. This feature can effectively be used to 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.
展开▼
