摘要
对现有三维不规则三角网(3DTIN)生成算法作了简要分类,回顾和评价了各类典型方法的优缺点和适用性,然后在此基础上提出了一种融合雕刻算法和生长算法优势的合成算法,给出了相应的数据结构。算法基于表面三角形任意一边的邻域结构,采用加权最小长度准则实现表面的快速生长。应用实例表明,算法可以重构具有任意拓扑的复杂表面,并且重构的三角网格表面与被采样的物体表面拓扑差别最小。
This paper firstly by analysing and classifying the wide variety of 3D TIN generation methods, provides a clear overall outline of all those typical methods. Secondly, a combinatorial algorithm for surface reconstruction from three-dimensional points is presented, which is a combination of the sculpture algorithm and growing algorithm. A region growing starting from arbitrary side of the seed triangle is preformed, During the growing procedure, a weighted minimal length criterion is employed to ensured geometric integrity and automatic boundary detection. Experimental results show that the algorithm can efficiently obtain the reconstructed mesh surface with arbitrary topology and with only small topological difference from the surface of the original object.
出处
《计算机应用研究》
CSCD
北大核心
2006年第8期159-161,共3页
Application Research of Computers
基金
国家"973"计划资助项目(2002CB312101)
湖北省青年杰出人才基金资助项目(2004ABB018)
关键词
三维TIN
表面重构
3D
DELAUNAY
三维可视化
3 D TIN
Surface Reconstruction
3 D Delaunay Triangulation
Three-Dimensional Visualization