三角形增长算法构建Delaunay三角网DEM的原理与实现  

Constructing Delaunay Triangulated of Network Digital Elevation Model Based on Triangular Growth Algorithm

作　　者：姬安召[1] 兰燕[2] 

机构地区：[1]成都理工大学能源学院,四川成都610059 [2]成都理工大学地球科学学院,四川成都610059

出　　处：《测绘》2009年第2期65-69,共5页Surveying and Mapping

摘　　要：本文主要论述了三角形增长算法建立Delaunay三角网DEM。首先通过最优边找首三角形,其次通过直线与点几何关系来寻找可能扩展点,通过找最大夹角来判断满足狄洛尼法则的扩展点,最后通过新加入边与已扩展边的数目来判断是否为重复狄洛尼扩展点,符合条件则构建三角网。然后通过空外接圆法则验证了所构三角网符合狄洛尼三角网的条件。狄洛尼三角网的建立和空外接圆的验证程序采用M语言来编写。This article discussed the establishment Delaunay Triangulation Net of DEM by triangular growth algorithm. First we finded the first triangle by optimal edge, following by a straight line and point geometry to find possible extension points and through to find the largest angle to judge the law of Delaunay expansion to meet, the finally through the new edges and extended edges the number we judged a repeat Delaunay expansion point if or not. If the conditions are meeting, the point is used. After construction of triangulation, we used the empty circum-circle law to do the verification of the triangulation, and the result is the triangulation network to meet the requirements of Delaunay rules. Construction of triangulation and empty circum-circle law of process are compiled by m language.

关 键 词：DELAUNAY三角网 空外接圆 三角形增长算法 MATLAB 

分 类 号：P208[天文地球—地图制图学与地理信息工程]