快速泡泡布点方法

泡泡布点算法能够在复杂区域上不经过人工干预生成高质量的节点集,为提高其计算效率,本文对泡泡布点法做三方面修正:①让泡泡运动的粘性系数c随时间的推移逐渐增大以加速收敛,每轮模拟结束后需增删泡泡时再给c赋一个较小的值以确保泡泡分布的质量;②求解控制泡泡运动的常微分方程组时选用时间复杂度较小的数值算法.算例表明数值方法精度在一定程度上的降低对节点质量的影响不大,能有效的节约计算时间;③取消对泡泡交叠率的排序,通过设置阈值控制泡泡的增删.算例表明以上方案节约运行时间40%以上,所布置节点对应的Delaunay三角单元网格平均质量高于0.9.该快速算法高效且能够生成高质量的节点集.

A Fast Node Placement Method with Bubble Simulation

Node placement method with bubble simulation can generate high-qualify node sets in complex domains.However,its efficiency needs to be increased.Several modifications were done to reduce the cost of simulation.Firstly,let viscosity coefficient c gradually increases instead of being taken as a constant.It speeds up convergency.Moreover,at the end of each round simulation,in which bubbles additions or deletions are operated,c is assigned to a small value in order to ensure quality of bubble distribution.Secondly,as solving ordinary differential equations that control movement of bubbles,a low order numerical algorithm is chosen.Finally,sort process of overlapping rate of bubbles is removed.It is replaced by setting only threshold for bubbles additions and deletions.Numerial examples show that computing cost decreases by approximately 40% and average quality of Delaunay triangulation corresponding to node set is over 0.9.It shows that the algorithms are efficient and generate node sets with high-quality.