为了改善四边形网格的拓扑连接关系,针对Liu等提出的优化方法[1](Liu Jianfei,Sun Shuli,Chen Yongqiang.A new method of quality improvement for quadrilateral mesh based on small polygon reconnection).Acta Mechanica Sinica,2012,28(1):140-145),提出了面向不规则点消除的四边形网格优化方法.首先引入了一个加速策略,使每次操作可以处理的区域更大,从而提高了消除不规则点的能力;其次将方法拓展至曲面网格的优化.数值实验结果表明,该方法既能够大幅度改善ANSYS等数值模拟软件生成的四边形网格,也能进一步提高使用图形学领域方法得出的四边形网格的质量.
Incremental algorithm is one of the most popular procedures for constructing Delaunay triangulations （DTs）. However, the point insertion sequence has a great impact on the amount of work needed for the construction of DTs. It affects the time for both point location and structure update, and hence the overall computational time of the triangulation algorithm. In this paper, a simple deterministic insertion sequence is proposed based on the breadth-first-search on a Kd-tree with some minor modifications for better performance. Using parent nodes as search-hints, the proposed insertion sequence proves to be faster and more stable than the Hilbert curve order and biased randomized insertion order （BRIO）, especially for non-uniform point distributions over a wide range of benchmark examples.
