水深三角网的快速构建及优化算法

Delaunay三角网目前被广泛用于等深线绘制,但存在将浅水区划入深水区的可能性,形成不合理的海底地形走势,从而对舰船航行安全构成危险。讨论了快速构建水深三角网的基本策略,如网格划分、逐点插入法、Delaunay子三角网的合并,提出了浅点相割算法。此算法通过比较相邻三角形顶点水深,对Delaunay三角网进行局部优化,构建合理的、符合航行安全原则的等深线。通过实例分析,证明本文所提算法是切实可行的。

Fast Creation of Depth Triangulation and Optimum Algorithm

Nowadays Delaunay triangulation is extensively used to draw depth contours,the weak point of which lies in that it is possible to move a shallow water zone to deep one in some circumstances,and result in unreasonable seafloor terrain which will be a potential danger to safe navigation.Based on a discussion on process for fast creation of depth triangulation,such as multi-grid,an approach of incrementally adding vertices to an existing triangulation and mergence of Delaunay triangulations,this paper presents an optimum algorithm,which detaches by two shallow depths.By depth comparing of neighbouring triangle vertexes and local optimization of Delaunay triangulations,the algorithm can draw reasonable depth contours which are suitable to navigation.Case analysis results prove that the algorithm presented in this paper is available.