计算机应用研究2013，Vol.30Issue(8)：2527-2529,3.DOI:10.3969/j.issn.1001-3695.2013.08.072
三维散乱点云快速曲面重建算法
Fast surface reconstruction algorithm for 3D scattered points
摘要
Abstract
This paper presented a fast surface reconstruction algorithm from scattered points based on Delaunay.It began with computing the Delaunay triangulation of the sampling point sets,extracted the primary triangles from Delaunay tetrahedrons,constructed priority queue based on the feature of Voronoi cell,selected seed triangles from the priority queue,and then extracted manifold surface by region-growing.Experimental results show that this method is robust and effective on handling surfaces with complex topology,boundaries,and even non-uniform sample points.Compared with the traditional approach based on Delaunay,the proposed algorithm requires only one-pass Delaunay computation and needs no poles computation,so it is more efficient.关键词
曲面重建/三维散乱点/流形提取/三角剖分Key words
surface reconstruction/ 3D scattered points/ manifold extraction/ Delaunay triangulation分类
信息技术与安全科学引用本文复制引用
宋大虎,李忠科,孙玉春..三维散乱点云快速曲面重建算法[J].计算机应用研究,2013,30(8):2527-2529,3.基金项目
国家科技支撑计划项目(2009BAI81B00) （2009BAI81B00）
