基于凸闭包集的不规则三角网算法研究与实现  

Research and implementation of irregular triangulation algorithm based on convex closure set

作　　者：蒋硕颜 雷斌[1] 胡青峰[1] Jiang Shuoyan;Lei Bin;Hu Qingfeng(North China University of Water Resources and Electric Power,Zhengzhou 450046,China)

机构地区：[1]华北水利水电大学,河南郑州450046

出　　处：《能源与环保》2020年第3期66-71,76,共7页CHINA ENERGY AND ENVIRONMENTAL PROTECTION

基　　金：国家自然科学基金资助项目(41301598)。

摘　　要：不规则三角网是影响土石方量计算的关键问题之一,虽然目前已有大量研究人员对Delaunay三角网进行优化,但仍然缺少对三角网生成速率和计算精度的综合研究。针对此问题,基于VB.NET平台的点、边以及三角形的结构化数据结构设计快速生成凸闭包集形成Delaunay三角网,通过四边形空圆特性以及对角线最短原则对构网结果进行检验和优化。试验计算表明,该算法的计算结果与经典DTM法、方格网法的土方量计算相对误差均在0.30%以内。该方法不仅具有较高的组网效率,并能保持较好的计算精度。Irregular triangulation is one of the key issues affecting the calculation of earthwork volume.Although a large number of researchers have optimized the Delaunay triangulation,there is still a lack of comprehensive research on the generation rate and calculation accuracy of the triangulation.Aiming at this problem,based on the structured data structure design of points,edges and triangles based on VB.NET platform,a convex closure set is quickly generated to form a Delaunay triangle network.Testing and optimization of network construction results through the characteristics of the quadrilateral empty circles and the principle of the shortest diagonal.Experimental calculations show that the relative errors between the calculation results of the algorithm and the classical DTM method and the grid method are less than 0.30%.This method not only has high networking efficiency,but also maintains good calculation accuracy.

关 键 词：凸闭包集 DELAUNAY三角网 算法 凸壳计算 土石方量 

分 类 号：P258[天文地球—测绘科学与技术]