摘要
论述了一种由计算机自动生成Delaunay三角网的增点生长构造法。该方法属于不规则三角网的动态构网法,它借鉴了静态构网法中递归生长算法的部分思想,并利用Lawson提出的最大最小(MAXMIN)角度法则对三角网进行即时的局部优化,从而达到了快速、有效地构建Delaunay三角网的目的。该方法对快速生成海底DEM数据,进行海底仿真具有重要的作用。
The thesis discusses a method of building triangulation automatically by computer,the point-added growing building method. This method is one of the methods which is used to build the triangulated irregular network dynamically. It uses the recursion growing method for reference,and makes use of the MAX-MIN angle principle brought forward by Lawson to do the local optimization instantly. This means can be used to build the Delaunay triangulation fleetly and efficiently. This method plays an important part in the process of creating DEM data of seabed and simulating the seabed terrain.
出处
《海洋测绘》
2005年第3期48-50,共3页
Hydrographic Surveying and Charting
