计算机科学 ›› 2020, Vol. 47 ›› Issue (11): 137-141.doi: 10.11896/jsjkx.191100051

• 计算机图形学&多媒体 • 上一篇    下一篇

基于改进Delaunay三角剖分的水下地形三维重建算法

陈士杰, 张森林, 刘妹琴, 郑荣濠   

  1. 浙江大学电气工程学院 杭州 310000
  • 收稿日期:2019-11-07 修回日期:2020-04-01 出版日期:2020-11-15 发布日期:2020-11-05
  • 通讯作者: 张森林(slzhang@zju.edu.cn)
  • 作者简介:21710105@zju.edu.cn
  • 基金资助:
    国家自然科学基金(U1709203,U1809212);浙江省科技计划项目(2018C03030)

Underwater Terrain Three-dimensional Reconstruction Algorithm Based on Improved Delaunay Triangulation

CHEN Shi-jie, ZHANG Sen-lin, LIU Mei-qin, ZHENG Rong-hao   

  1. College of Electrical Engineering,Zhejiang University,Hangzhou 310000,China
  • Received:2019-11-07 Revised:2020-04-01 Online:2020-11-15 Published:2020-11-05
  • About author:CHEN Shi-jie,born in 1995,postgradua-te.His main research interests include underwater information processing and 3D visualization.
    ZHANG Sen-lin,born in 1964,postgraduate,professor,Ph.D supervisor.His main research interests include ocean information technology,artificial intelligence,image processing and pattern recognition.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China(U1709203,U1809212) and Science and Technology Program of Zhejiang Province, China (2018C03030).

摘要: 在对水下地形进行三维表面重建时,常用的方法是将点云数据投影到二维平面,用Delaunay三角剖分算法生成三角形格网,然后结合水深高程值还原到三维空间中。但是此方法效率较低,同时在投影时舍去了水深高程值信息,在三维空间内易生成狭长三角形,不利于地形地貌的三维展示效果。因此在采用逐点插入法的基础上,对其中的插入点定位和局部优化过程分别进行了改进,提出了一种融合定位算法,计算三角形矢量面积后,找到搜索前进方向并进行定位,保证了定位路径的唯一性且提高了效率;同时在局部优化过程中引入了水深高程值,计算三维空间内三角形的角度标准差,并将其作为与正三角形相似程度的衡量标准,替换空外接圆准则,使得三维空间内的网格更加均匀化。实验结果表明,该方法在水下地形三维重建的模型质量和构建效率上均优于传统的Delaunay三角剖分算法。

关键词: Delaunay 三角剖分, 局部优化, 水下地形, 逐点插入法, 最小标准差

Abstract: In surface reconstruction of underwater terrain,the commonly used method is to project point cloud data to two-dimensional plane,and use Delaunay triangulation algorithm to generate triangular grid,then combine the depth elevation value in order to restore to three-dimensional space.However,the efficiency of this method is low,and the depth elevation value is abandoned during projection,so it's easy to generate long and narrow triangles in three-dimensional space,which is not conducive to the display effect.Based on the point by point insertion method,the location of the insertion point and the local optimization procedure are improved respectively.The specific performance is as follows:a fusion location algorithm is proposed to find the search direction and locate after calculating the triangle vector area,so as to ensure the uniqueness of the location path and improve the efficiency.At the same time,the depth elevation value is introduced to the local optimization procedure.The standard deviation of triangle angle in three-dimensional space is calculated and used as the standard to measure the similarity to normal triangle.The criterion of empty circumscribed circle is replaced to make the gird more uniform in three-dimensional space.The experimental results show that this method is superior to the traditional Delaunay triangulation algorithm in terms of model quality and construction efficiency.

Key words: Delaunay triangulation, Local optimization, minimum standard deviation, point by point insertion, Underwater terrain

中图分类号: 

  • P229
[1] FAN M,SUN Y,XING Z,et al.Seafloor high precision terrain reconstruction based on multi-source water depth data fusion [J].Journal of Oceanography,2017,39(1):130-137.
[2] ZHAI J S,ZHANG C,LI Z X,et al.The representation and calculation of the complexity of submarine topography [J].Journal of China Ocean University (Natural Science Edition),2019,49(S1):143-147.
[3] HU J X,PAN N,MA Z T,et al.Research on the algorithm of constructing Delaunay triangulation digital terrain model efficiently [J].Journal of Peking University (Natural Science Edition),2003,39(5):736-741.
[4] XU J Z,MA L Z.An improved algorithm for incremental insertion of Delaunay triangulation [J].Computer Engineering,2008(17):254-256.
[5] KONG D W.Triangulation and 3D reconstruction of point cloud data [J].Journal of Southwest Normal University (Natural Science Edition),2019,44(7):87-92.
[6] JIA J H,HUANG M,LIU X L.Surface reconstruction algorithm based on three-dimensional Delaney triangulation [J].Journal of Surveying and Mapping,2018,47(2):281-290.
[7] YUAN Q L,WU X Q.3D surface reconstruction algorithm combining Delaunay triangulation method and search ball strategy [J].Journal of Graphics,2018,39(2):278-286.
[8] YU J,LV P,ZHENG C W,et al.Comparative study on the construction methods of Delaunay triangulation network [J].Chin-ese Journal of Image Graphics,2010,15(8):1158-1167.
[9] LAWSON C L.Generation of a triangular grid with application to contour plotting[M].California:Jet Propulsion Laboratory,Pasadena,1972.
[10] CHEN M J,FANG Y M,LI G Z,et al.An improved generation algorithm of Delaunay triangulation network[J].Journal of Kunming University of Science and Technology (Natural Science Edition),2016(5):33-38.
[11] LIU S H,WU D S,LUO X L,et al.Research on fast positioning algorithm of point target in Delaunay triangle network [J].Surveying and Mapping Science,2007,32(2):69-70.
[12] ZOU Y G,ZHANG T.Improved Delaunay triang- ulation algorithm in plane domain [J].Computer Engin Eering and Application,2013,49(20):171-174.
[1] 华茂,余世明.
一种改进的混沌伊藤算法求解车辆配送问题
Modified Chaotic ITO Algorithm to Vehicle Routing Problem
计算机科学, 2016, 43(3): 266-270. https://doi.org/10.11896/j.issn.1002-137X.2016.03.049
[2] .
约束三角剖分研究

计算机科学, 2008, 35(8): 6-9.
[3] 贺一 刘光远 雷开友 贺三 邱玉辉.
多层前向神经网络的自适应禁忌搜索训练

计算机科学, 2005, 32(6): 118-120.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!