摘要

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.

全文