摘要
针对Delaunay三角网生长算法构网效率不高的问题,引进逐点插入法中的凸壳技术,利用凸壳作为初始多边形构建Delaunay三角网;在搜索前,按一定规则对搜索范围进行限制;在搜索三角形的第3点时,采用直线方程正负区域进行判别。测试结果表明,改进的算法在构网效率上有明显提高,在精度方面也有一定的改善。
To aim at the problem that the efficiency of building delaunay triangulation was relatively poor, convex-frame was adopted to build initial polygon, and then to construct the delaunay triangulation. Before searching, the scope of search was restricted according to certain rules. Also, we searched the third point of the extensional triangle by using regional discrimination principle of the linear equations. The experiments show that there is obvious enhancement in efficiency by the improved algorithm, and also certain improvement in precision.
出处
《气象与环境科学》
2008年第2期80-82,共3页
Meteorological and Environmental Sciences
关键词
不规则三角网
DELAUNAY三角网
凸壳
triangular irregular network （ TIN ）
delaunay triangulation
convex-frame
