约束数据域的Delaunay三角剖分算法研究及应用  

A Study on Algorithm of Delaunay Triangulation for the Constrained Data Set and Application

作　　者：刘少华[1] 程朋根[1] 赵宝贵[1] 

机构地区：[1]东华理工学院测量系

出　　处：《计算机应用研究》2004年第3期26-28,共3页Application Research of Computers

基　　金：国家"973"基金资助项目(G2000077904);国家重点实验室开放研究基金资助项目(010302)

摘　　要：研究了一种约束Delaunay三角网生成算法,它充分利用分治算法与生长算法的优点,对离散点、构网中实时生成的边及三角形采用分块进行网格索引,有效地减少了搜索目标点、边及三角形的时间,从而提高了构网速度,并将该算法用于地面模型的构建中,实现了地形三维可视化。This paper researches the algorithm of the constrained delaunay triangulation net generation .This algorithm makes use of virtues of divide-conquer algorithm and triangulation growth algorithm,adopting clump organization to establish grid index for separate points,edges and triangles that are generated real-time in constructing TIN.It is effective to reduce the time of searching goal points and triangles,and improves the speed of constructing TIN. This algorithm is applied to Construction of terrain surface model ,which realizes 3D visualization.

关 键 词：DTM DELAUNAY三角网 约束数据 网格索引 算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术] P207[自动化与计算机技术—计算机科学与技术]