| 结合Delaunay 三角面分离法与搜索球策略的三维曲面重建算法 |
| |
| 引用本文： | 袁清洌,吴学群. 结合Delaunay 三角面分离法与搜索球策略的三维曲面重建算法[J]. 图学学报, 2018, 39(2): 278. DOI: 10.11996/JG.j.2095-302X.2018020278 |
| |
| 作者姓名： | 袁清洌 吴学群 |
| |
| 作者单位： | 1. 攀枝花学院土木与建筑工程学院，四川 攀枝花 617000；2. 昆明理工大学国土资源工程学院，云南 昆明 650093 |
| |
| 基金项目： | 国家自然科学基金项目(41161071) |
| |
| 摘 要： | 基于曲面重建在计算机图形学、三维GIS、逆向工程等领域有重要应用，结合区域生长法与Delaunay 三角剖分的优势，提出了一种新的散乱点云曲面重建算法。首先根据曲面中轴性质提出了分离角定义并推导了相关结论，利用局部Delaunay 三角形分离角性质抽取大量位于模型表面三角形，从而构建种子三角网增加初始区域的生长面积其次运用自适应搜索球法加快邻域三角形搜索并识别曲面边界。对比传统的基于Delaunay 法和传统区域生长法，该方法只需要一次三角剖分，无需极点与法向量计算，重建速度快，具有Delaunay 三角网格的优良结构特性，孔洞数量少，重建出的三维模型几何信息与拓扑关系准确。实验表明，结合Delaunay三角剖分与区域生长法重构有向的流形三角网格模型，能够提高三维模型的重建效果与速度，有效地自动识别曲面边界。
|
| 关 键 词： | 表面重建 点云 Delaunay 分离角 区域生长 |
3D Surfaces Reconstruction Algorithm Via Detaching Delaunay#br#Triangular Mesh and Search-Ball Approach |
| |
| YUAN Qinglie,WU Xuequn. 3D Surfaces Reconstruction Algorithm Via Detaching Delaunay#br#Triangular Mesh and Search-Ball Approach[J]. Journal of Graphics, 2018, 39(2): 278. DOI: 10.11996/JG.j.2095-302X.2018020278 |
| |
| Authors: | YUAN Qinglie WU Xuequn |
| |
| Affiliation: | 1. School of Civil and Architectural Engineering, Panzhihua University, Panzhihua Sichuan 617000, China;2. School of Land and Resources Engineering, Kunming University of Science and Technology, Kunming Yunnan 650093, China |
| |
| Abstract: | 3D surface reconstruction are becoming increasing important in geometric modeling andrelated applications such as in computer graphics, 3D GIS, reverse engineering. This paper presents analgorithm that holds the advantages of both region- growth approaches and Delaunay based onunorganized point cloud. Separation angle is defined and deduced the related conclusion according to thenature of the surface axis, which is applied to extract triangles from the surface of model and increase theinitial growth area of the region. An approach of adaptive search-ball method is presented to speed upsearching the neighbourhood-triangles and identify the surface boundary. Compared with the traditionalDelaunay-based approach, this algorithm requires only one-pass Delaunay computation and reconstructsurfaces rapidly without calculation of pole and the vector. Compared with the traditional region growingmethod, this algorithm inherits the structural characteristics of the Delaunay triangulation with fewer holesand accurate the 3D geometry information and topology. Experimental results shows that it is highly efficient compared with other existing algorithms and capable of handling surfaces with complex topology,boundaries, which holds the advantages of both region- growth approaches and Delaunay. |
| |
| Keywords: | surface-reconstruction point-cloud Delaunay separation angle reigon-growing |
|
| 点击此处可从《图学学报》浏览原始摘要信息 |
|
点击此处可从《图学学报》下载免费的PDF全文 |
