范围收拾行李是产生高质量的网孔的一个吸引人的方法。几个算法在这个话题被建议了,然而,这些算法不为大规模问题是足够地快的。纸论述包装快得多并且看起来在包装到目前为止为网孔产生介绍的方法的所有范围之中最实际的算法的一个有效范围。算法用推进前面方法在域内包装范围。高效率源于 4R 措施的一个概念,它本地化涉及包装过程的整个范围的所有计算。
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.