数字城市中建筑物模型与地形的拼接算法研究_贾甲.pdfVIP

25 11 Vol. 25 No. 11 2008 11 M ICROELECTRONICS COMPUTER November 2008 1 2 贾 甲, 张建斌 ( 1 , 10086; 2 , 213001) : 约束边的嵌入是实现数字城市建筑物和地形拼接的算法基础, 总结 约束边嵌入算法的特点和优缺点, 提 出改进的多边形嵌入算法, 即 一次性将多边形嵌入三角网中, 在进行基础重构的基础上, 进行优化处理. 该算法能 够适应多种情况, 易于理解和实现, 能够很好地符合工程要求. : 拼接; 约束边嵌入算法; Delaunay 三角剖分; 多边形 : TP393 : A : 1000- 180( 2008) 11- 0225- 04 Research on Joint Algorithm of Building Models and Terrain in Digital Cities 1 2 JIA Jia , ZHANG Jianbin ( 1 Dept. of Postgraduates, Engineering College of the Armed Police Force, Xian 10086, China; 2 College of Electronics Information, Jiangsu Teachers University of Technology , Changzhou 213081, China) Abstract: Inserting constrained boundary is t he basis of the digital model of urban buildings and terrain connection algo rithms. This paper summarizes the characteristics, advantages and disadvantages of algorithm of inserting constrained boundary and proposes the improved polygon inserted algorithm, that is, polygon w ill be inserted onetime into the trian gulation, and based on the elementary reconstruction, optimizes the processing. The algorithm adapts to many situations, easily to be understood and achieved, and accords w ell w ith the engineering requirements. Key words: joint; inserting constrained boundary algorithm; Delaunay triangulation; polygon , Delaunay ( DTIN) 1 . 3S , . , , DT IN , DT IN , 3 . , . 3 , DTIN , : , ; , , , , , , . 3 . 2 ,