线特征约束的三维无序点云网格模型重建
Three Dimensional Space Reconstruction from Unordered Point Cloud under the Constraint of Line Feature
DOI: 10.12677/GST.2018.62009, PDF,    科研立项经费支持
作者: 梁 艳：江苏海事职业技术学院，江苏 南京
关键词: 线特征；约束；重建；Line Feature； Constraint； Reconstruction
摘要: 顾及建筑物轮廓特征的三维表面网格剖分是城市三维建模的基础。本文在对比分析了约束数据域的Delaunay三角剖分相关算法的基础上，提出了一种适用于线特征约束的三维无序散乱点云的三角网格剖分方法，该方法首先用Hash函数方法建立数据索引，然后利用生长法对无约束数据域进行三角网格剖分构建初始三角形，再在约束线段的影响区域内采用插入–交换相结合的算法进行三角网局部重建，从而实现了线特征约束的三维点云网格模型重建。最后以建筑物的模型重建为例进行验证，结果表明本文方法能有效地保证模型的正确性，有助于城市三维建模工作。
Abstract: Triangulation under the line features constraint is the foundation of urban 3D modeling. Based on the analysis of the algorithms related with Constraint Delaunay Triangulation, a method based on two-step is proposed in this paper; firstly the data point index is established using Hash function method, then the initial triangulation mesh of unconstrained data is generated using the surface growth method, and local network is triangulated in the affected area of constrained line segments, and a complete three-dimensional model is reconstructed. Finally, taking the building reconstruction as an example, the validity and reliability of the proposed method are verified by comparison and analysis.
文章引用：梁艳. 线特征约束的三维无序点云网格模型重建[J]. 测绘科学技术, 2018, 6(2): 72-78. https://doi.org/10.12677/GST.2018.62009

参考文献

[1] 陆建华, 胡大贺, 吕志才, 等. 大型古建筑精密三维数据采集方法与实践[J]. 现代测绘, 2017, 40(1): 43-47.
[2] 刘学军, 龚健雅. 约束数据域的Delaunay三角剖分与修改算法[J]. 测绘学报, 2001, 30(1): 82-88.
[3] Lee, D.T. (1986) Generalized Delaunay Triangulation for Planar Graphs. Discrete and Computational Geometry, 1, 201-217.
[4] Chew, L.P. (1987) Constrained Delaunay Triangulation. Proceedings of Third ACM Symposium on Computational Geometry. Waterloo, 216-222.
[5] Boissinnat, J.D. (1988) Shape Reconstruction from Planar Sections. Computer Vision，Graphics，and Image Processing, 44, 1-29. [Google Scholar] [CrossRef] 
[6] Piegl, L.A. (1993) Algorithm and Data Structure for Triangulation Multiply Connected Polygonal Domains. Computer and Graphics, 17, 563-574. [Google Scholar] [CrossRef] 
[7] Sloan, S.W. (1987) A Fast Algorithm for Constructing Delaunay Triangulation in the Plane. Advanced Engineering Soft wa e, 9, 34-55.
[8] Floriani, L.D. (1992) An Online Algorithm for Constrained Delaunay Triangulation. CVGIP: Graphical Models and Image Processing, 54, 290-300.
[9] 冯义从. 车载LiDAR点云的建筑物立面信息快速自动提取[D]. 西南交通大学, 2014.
[10] 卢学良, 童晓冲, 张永生. 城市密集点云的区域生长表面构网改进算法[J]. 武汉大学学报(信息科学版), 2016, 41(6): 832-837.
[11] 孙存亮. 空间散乱点曲面重构的三角剖分技术研究[D]. 南京航空航天大学, 2009.
[12] 许多文. 不规则三角网(TIN)的构建及应用[D]. 江西理工大学, 2010.
[13] 臧波. 基于移动机器人激光测距数据的物体三维重建[D]. 大连理工大学, 2005.
[14] 颜林. 约束Delaunay三角网生成算法及其应用研究[D]. 北京化工大学, 2010.
[15] 刘少华, 程朋根, 赵宝贵. 约束数据域的Delaunay三角剖分算法研究及应用[J]. 计算机应用研究, 2004, 21(3): 26-28.

为你推荐