基于切割路径树优化的三角化网格曲面自动切割  

Automatically trim triangulated surfaces by optimizing seam tree

作　　者：李基拓[1] 陆国栋[1] 张东亮 

机构地区：[1]浙江大学CAD&CG国家重点实验室 [2]Digital Fashion Ltd

出　　处：《浙江大学学报（工学版）》2006年第8期1320-1326,共7页Journal of Zhejiang University：Engineering Science

基　　金：国家自然科学基金资助项目(60473129)

摘　　要：为了减少曲面展开后的变形和优化切割路径,提出了一种三角化网格曲面的自动切割算法.该方法将导入的曲面切割成带单一边界环的流形曲面,在高斯曲率较高的顶点和曲面边界之间生成切割路径.切割路径的生成有两个约束条件,即尽可能短而直,且尽可能经过曲面的棱边.曲面边界和众多的切割路径构成了初始切割路径树;在此基础上优化切割路径树,删除短小切割路径,并使优化后的切割路径树尽可能光滑;由优化后的切割路径树对曲面进行一次性切割,得到具有良好可展性的网格曲面.实验表明,该算法执行效率高、切割效果好.A new algorithm of automatically trimming triangulated surfaces was presented to reduce the distortion of the flattened surface and optimize seam tree. A surface was cut into a manifold with only one boundary loop by optimized seam tree. Cutting paths going through vertices with high Gaussian curvature and linking to surface boundary were generated automatically. In the algorithm, constraints were used to make the cutting path be as straight and short as possible, and go through sharp edges of the surface. The seam tree consisting of all cutting paths was optimized by deleting short cutting paths and smoothing cutting paths. Experiments showed that the algorithm is efficient and the cutting results are good.

关 键 词：三角化网格曲面 自动切割 路径树 优化 可展性 高斯曲率 

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