Computer Science ›› 2020, Vol. 47 ›› Issue (11): 137-141.doi: 10.11896/jsjkx.191100051

• Computer Graphics & Multimedia • Previous Articles     Next Articles

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).

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

CLC Number: 

  • 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] QING Wen-xing, CHEN Wei. Delaunay Triangular Mesh Optimization Algorithm [J]. Computer Science, 2019, 46(6A): 226-229.
[2] WANG Hua. Improved Method for Blade Shape Simulation Based on Vein Shape Function [J]. Computer Science, 2019, 46(6A): 234-238.
[3] JIAO Chong-yang, ZHOU Qing-lei and ZHANG Wen-ning. MPSO and Its Application in Test Data Automatic Generation [J]. Computer Science, 2017, 44(12): 249-254.
[4] WANG Dong, MA Chun-yong and CHEN Ge. Fast Image Registration Algorithm for PCB Images [J]. Computer Science, 2016, 43(Z6): 152-155.
[5] HUA Mao and YU Shi-ming. Modified Chaotic ITO Algorithm to Vehicle Routing Problem [J]. Computer Science, 2016, 43(3): 266-270.
[6] LI Chun-xin and PENG Ren-can. Rapid Visualization Method Based on 3D Delaunay Triangulation [J]. Computer Science, 2015, 42(Z6): 236-237.
[7] BI Shuo-ben,CHEN Dong-qi,YAN Jian and GUO Yi. Planar Delaunay Triangulation Algorithm Based on 2D Convex Hull [J]. Computer Science, 2014, 41(10): 317-320.
[8] WU Jian-hui,ZHANG Jing,ZHANG Xiao-gang,LIU Zhao-hua. Novel Hierarchical Immune Algorithm for TSP Solution [J]. Computer Science, 2010, 37(6): 256-260.
[9] . [J]. Computer Science, 2008, 35(8): 6-9.
[10] . [J]. Computer Science, 2007, 34(12): 182-183.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!