Sphere packing is an attractive way to generate high quality mesh. Several algorithms have been proposed in this topic, however these algorithms are not sufficiently fast for large scale problems. The paper presents an efficient sphere packing algorithm which is much faster and appears to be the most practical among all sphere packing methods presented so far for mesh generation. The algorithm packs spheres inside a domain using advancing front method. High efficiency has resulted from a concept of 4R measure, which localizes all the computations involved in the whole sphere packing process.

SUMMARYLocal transformation, or topological reconnection, is one of the effective procedures for mesh improvement method, especially for three-dimensional tetrahedral mesh. The most frequently used local transformations for tetrahedral mesh are so-called elementary flips, such as 2-3 flip, 3-2 flip, 2-2 flip, and 4-4 flip. Owing to the reason that these basic transformations simply make a selection from several possible configurations within a relatively small region, the improvement of mesh quality is confined. In order to further improve the quality of mesh , the authors recently suggested a new local transformation operation, small polyhedron reconnection (SPR) operation, which seeks for the optimal tetrahedralization of a polyhedron with a certain number of nodes and faces (typically composed of 20-40 tetrahedral elements).This paper is an implementation of the suggested method. The whole process to improve the mesh quality by SPR operation is presented; in addition, some strategies, similar to those used in advancing front technique, are introduced to speed up the operation. The numerical experiment shows that SPR operation is quite effective in mesh improvement and more suitable than elementary flips when combined with smoothing approach. The operation can be applied to practical problems, gaining high mesh quality with acceptable cost for computational time.

No abstract

No abstract

No abstract