Abstract
A new mesh generation algorithm for extremely large scale finite element analysis is proposed in this paper. In this algorithm, the analysis domain is decomposed spaciously to the so-called buckets and mesh generation process is performed on each bucket independently. Therefore this algorithm has the good feature of locality of data reference and is basically parallelizable. In each bucket, nodes are generated on grids according to the nodal density field, which is defined on each bucket, and the consistency on the boundary of each bucket is realized by simple mapping technique. Fundamental performances of this algorithm are also shown in this paper.
