散乱数据点的增量快速曲面重建算法  

A Fast Progressive Surface Reconstruction Algorithm for Unorganized Points

作　　者：王青[1] 王融清[1] 鲍虎军[1] 彭群生[1] 

机构地区：[1]浙江大学CAD&CG国家重点实验室,杭州310027

出　　处：《软件学报》2000年第9期1221-1227,共7页Journal of Software

基　　金：国家自然科学杰出青年基金 !(No.6 992 5 2 0 4);高等学校骨干教师基金资助

摘　　要：给出了一个新的散乱数据的曲面重建算法 .算法充分利用邻近点集反映出的局部拓扑和几何信息 ,基于二维 Delaunay三角剖分技术快速地实现每个数据点的局部拓扑重建 ,然后通过自动矫正局部数据点的非法连接关系 ,以增量扩张的方式把局部三角网拼接成一张标准的整体二维流形网格 .该算法在重建过程中能自动进行洞的检测 ,判断出散乱数据所蕴涵的开或闭的拓扑结构 .实验结果表明 ,该算法高效、稳定 ,可以快速地直接重构出任意拓扑结构的二维流形三角形网格 .A novel algorithm for fitting surface reconstruction of unorganized data points is presented in this paper. Since the local geometric and topological properties can be clearly described with its neighboring points for a given point, the algorithm takes full advantage of this fact to generate a local triangular mesh based on Delaunay triangulation technique in two dimensions. The main contribution of the proposed algorithm is to progressively integrate those local triangular meshes into a resulting mesh by deleting the illegal triangles. In addition, holes and gaps can be detected automatically during reconstruction, and the algorithm works well for models with arbitrary topology. Experimental results show that this algorithm is effective, robust and can be easily implemented.

关 键 词：曲面重建 散乱数据点 几何造型 CAD 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]