Three-Dimensional TIN Algorithm for Digital Terrain Modeling

作     者：ZHU Qing ZHANG Yeting LI Fengchun ZHU Qing;ZHANG Yeting;LI Fengchun

作者机构：State Key Laboratory of Information Engineering in Surveying Mapping and Remote SensingWuhan University 129 Luoyu Road Wuhan 430079 China. 不详 

出 版 物：《Geo-Spatial Information Science》 (地球空间信息科学学报（英文）)

年 卷 期：2008年第11卷第2期

页      面：79-85页

核心收录：

学科分类：081603[工学-地图制图学与地理信息工程] 081802[工学-地球探测与信息技术] 07[理学] 08[工学] 070503[理学-地图学与地理信息系统] 0818[工学-地质资源与地质工程] 0705[理学-地理学] 0816[工学-测绘科学与技术] 

基　　金：Supported by the National Natural Science Foundation of China (No.40671158)  the National 863 Program of China(No.2006AA12Z224) and the Program for New Century Excellent Talents in University (No.NCET-05-0626) 

主　　题：three dimensional triangulated irregular network digital terrain surface modeling Delaunay triangulation 

摘      要：The problem of taking an unorganized point cloud in 3D space and fitting a polyhedral surface to those points is both important and difficult. Aiming at increasing applications of full three dimensional digital terrain surface modeling, a new algorithm for the automatic generation of three dimensional triangulated irregular network from a point cloud is pro- posed. Based on the local topological consistency test, a combined algorithm of constrained 3D Delaunay triangulation and region-growing is extended to ensure topologically correct reconstruction. This paper also introduced an efficient neighbor- ing triangle location method by making full use of the surface normal information. Experimental results prove that this algo- rithm can efficiently obtain the most reasonable reconstructed mesh surface with arbitrary topology, wherein the automati- cally reconstructed surface has only small topological difference from the true surface. This algorithm has potential applica- tions to virtual environments, computer vision, and so on.