数字地形建模的真三维TIN算法研究(英文) |
| |
作者单位: | State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing,Wuhan University,129 Luoyu Road,Wuhan430079,China |
| |
基金项目: | 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). |
| |
摘 要: | 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 proposed. 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 neighboring triangle location method by making full use of the surface normal information. Experimental results prove that this algorithm can efficiently obtain the most reasonable reconstructed mesh surface with arbitrary topology, wherein the automatically reconstructed surface has only small topological difference from the true surface. This algorithm has potential applications to virtual environments, computer vision, and so on.
|
关 键 词: | 三角形 三维网络 测绘数据库 地球科学 |
Three-dimensional TIN algorithm for digital terrain modeling |
| |
Authors: | Qing Zhu Yeting Zhang Fengchun Li |
| |
Institution: | (1) State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, 129 Luoyu Road, Wuhan, 430079, China |
| |
Abstract: | 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. |
| |
Keywords: | three dimensional triangulated irregular network digital terrain surface modeling Delaunay triangulation |
本文献已被 CNKI 维普 SpringerLink 等数据库收录! |