期刊文献+

基于不规则三角网的水下地形导航数据库构建方法的优化(英文) 被引量:3

Optimized method of building underwater terrain navigation database based on triangular irregular network
下载PDF
导出
摘要 采用规则格网模型构建地形导航数据库时,存在精度较低以及效率较低的问题。为了优化地形导航数据库构建方法,提出了一种基于不规则三角网的地形导航数据库构建方法。基于分割合并法对源数据点按经纬度坐标进行分割,分别求出每个数据块数据点的凸壳,然后依据改进的凸壳算法逐点加入非凸壳数据点形成子块三角网,用改进的三角网合并算法对相邻的凸壳子块进行合并,完成子三角网的优化合并形成完整的地形导航数据库。仿真结果表明基于不规则三角网的地形导航数据库构建方法具有效率高、精度高、分辨率可调整的优点。 In view that using a regular grid model to build a underwater terrain navigation database has the problems of low accuracy and low efficiency, an optimized method is proposed to build an underwater terrain navigation database based on a triangular irregular network. Convex hulls are calculated for each block of data points with latitude and longitude coordinates by using a divide and conquer algorithm. Then, according to the improved convex hull algorithm, the sub-triangular irregular networks are formed by adding nonconvex hull data points to the convex hulls. Adjacent convex shell blocks are combined by using an improved algorithm for triangulation, and the terrain navigation database is completed by merging and optimizing the sub-triangulations. Simulation results show that building a terrain navigation database using the construction methods associated with a triangular irregular network has such advantages as high efficiency, high accuracy, and the ability to adjust resolution.
出处 《中国惯性技术学报》 EI CSCD 北大核心 2015年第3期345-349,共5页 Journal of Chinese Inertial Technology
基金 国家自然科学基金资助项目(61203192,51477028,51405203) 中央高校基本科研业务费专项资金资助(东南大学优秀青年教师项目-2242013R30016) 船舶工业预研基金(13J3.8.4)
关键词 水下地形导航数据库 不规则三角格网 凸壳算法 分割合并算法 underwater terrain navigation database triangular irregular network convex hull algorithm divide and conquer algorithm
  • 相关文献

参考文献15

  • 1Anonsen K B, Hagen O K. An analysis of real-time terrain aided navigation results from a HUG1N AUV[C]//IEEE Oceans 2010 Conference. Seattle, WA, USA, 2010. 被引量:1
  • 2Anonsen H K, Mandt M. The HUGIN real-time terrain navigation system[C]//IEEE Oceans 2010 Conference. Seattle, WA, USA, 2010. 被引量:1
  • 3Deronde B, Houthuys R, Debruyn W. Use of airborne hyperspectral data and laserscan data to study beach morphodynamics along the Belgian coast[J]. Journal of Coastal Research, 2006, 22(5): 1108-1117. 被引量:1
  • 4Nguyen V T. Building T1N (triangular irregular network) problem in Topology model[C]//2010 International Con- ference on Machine Learning and Cybernetics. 2010. 被引量:1
  • 5Nam N M, Kiem H V, Nam N V. A fast algorithm for constructing constrained delaunay triangulation[C]//Inter- national Conference on Computing and Communication Technologies. 2009. 被引量:1
  • 6Nordlund P J, Gustafsson F. Marginalized particle filter for accurate and reliable terrain-aided navigation[J]. Aero- space and Electronic Systems, 2009, 45(4): 1385-1399. 被引量:1
  • 7Liu Yong-xue, Li Man-chun, Mao Liang, et al. Toward a method of constructing tidal flat digital elevation models with MOD1S and medium-resolution satellite images[J]. Journal of Coastal Research, 2013, 29(2): 438-448. 被引量:1
  • 8张显全,刘丽娜,唐振军.基于凸多边形的凸壳算法[J].计算机科学,2006,33(9):218-221. 被引量:6
  • 9武晓波,王世新,肖春生.Delaunay三角网的生成算法研究[J].测绘学报,1999,28(1):28-35. 被引量:349
  • 10Chan T M. Optimal output-sensitive convex hull algorithms in two and three dimensions[J]. Geometry, 1996, 16(1): 361-368. 被引量:1

二级参考文献13

  • 1崔国华,洪帆,余祥宣.确定平面点集凸包的一类最优算法[J].计算机学报,1997,20(4):330-334. 被引量:15
  • 2毋河海.地图数据库系统[M].北京:测绘出版社,1991.. 被引量:35
  • 3柯正谊,数字地面模型,1993年 被引量:1
  • 4毋河海,地图数据库系统,1991年 被引量:1
  • 5Chand D R,Kapur S S.An algorithm for convex polytopes[J].JACM,1970,17(1):78~86 被引量:1
  • 6Jarvis R A.On the identification of the convex hull of a finite set of points in the plane[J].Information Processing Letters,1973,2(1):18~21 被引量:1
  • 7Graham R L.An efficient algorithm for determine the convex hull of a finite linear set[J].Information Processing Letters,1972,1(1):132~133 被引量:1
  • 8Preparata F P,Hong S J.Convex hullsof finite sets of points in two and three dimensions[J].CACM,1977,20(2):87~93 被引量:1
  • 9Chan T.Optimal output-sensitive convex hull algorithms in two and three dimensions[J].Discrete Comput Geom,1996,16(3):361~368 被引量:1
  • 10Bronnimann H,Iacono J,Katajainen J,et al.Space-efficient planar convex hull algorithms[J].Theoretical Computer Science,2004,321(1):25~40 被引量:1

共引文献353

同被引文献30

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部