节点文献

一种改进的2D-Delaunay三角剖分算法

An Improved 2D-Delaunay Triangulation Dissection Algorithm

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 施友道何曙光傅琼波靳俊霞

【Author】 SHI You-dao1,HE Shu-guang2,FU Qiong-bo3,JIN Jun-xia4 (1.Fuzhou Municipal Public Security Bureau,Fuzhou 350011,China; 2.Changjiang Daily Newspaper Group,Wuhan 430019,China; 3.Hubei Rural Credit Cooperatives Union,Wuhan 430015,China; 4. Wuhan University of Technology,Wuhan 430070,China)

【机构】 福州市公安局长江日报报业集团湖北省农村信用社联合社武汉理工大学

【摘要】 针对大规模工程中空间数据点的采集不均匀、等值矩形格网格分块会出现严重的两块数据点比例无效,影响Delaunay子三角网格的合并效率,给出了一种改进的2D-Delaunay的三角剖分算法.该算法避免了以往靠—边点关系方向定位方法所产生的二义性,通过结合该剖分算法实现了对工程桩基数据的三角剖分,取得了理想效果.

【Abstract】 Aimed at the phenomena that the acquisition of space data points in large-scale engineering is of ununiformity,the proportion of two partitioning data point is seriously of no effect,and the combination efficiency of sub-triangular grid is affected,an improved 2D-Delaunay triangulation algorithm was given.The proposed algorithm avoids the ambiguity caused previously by using the location method in one side point relative direction,and the triangular dissection of engineering piling data can be implemented by combining this dissection algorithm,doing the trick.

  • 【文献出处】 空军雷达学院学报 ,Journal of Air Force Radar Academy , 编辑部邮箱 ,2010年02期
  • 【分类号】TP391.41
  • 【被引频次】4
  • 【下载频次】185
节点文献中: 

本文链接的文献网络图示:

本文的引文网络