摘要
顾及建筑物轮廓特征的三维表面网格剖分是城市三维建模的基础。本文在对比分析了约束数据域的Delaunay三角剖分相关算法的基础上,提出了一种适用于线特征约束的三维无序散乱点云的三角网格剖分方法,该方法首先用Hash函数方法建立数据索引,然后利用生长法对无约束数据域进行三角网格剖分构建初始三角形,再在约束线段的影响区域内采用插入–交换相结合的算法进行三角网局部重建,从而实现了线特征约束的三维点云网格模型重建。最后以建筑物的模型重建为例进行验证,结果表明本文方法能有效地保证模型的正确性,有助于城市三维建模工作。
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.
出处
《测绘科学技术》
2018年第2期72-78,共7页
Geomatics Science and Technology
基金
江苏省测绘地理信息科研项目(JSCHKY201605)。
