基于STL模型的表面区域递归拾取算法  

Surface region recurrence picking up algorithm based on stereolithography model

作　　者：钱波[1] 张李超[1] 史玉升[1] 刘冰[1] 

机构地区：[1]华中科技大学材料成形与模具技术国家重点实验室,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2008年第9期90-93,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：湖北省自然科学基金创新群体资助项目(2004ABC001)

摘　　要：针对传统基于立体平面印刷(STL)文件的三维模型表面区域拾取生成算法速度慢、效率低且不易识别裂缝等非正常情况,提出了一种采用递归搜索的表面区域快速拾取算法.该算法利用模型中所有三角面片构造拓扑信息,通过面片相邻和边重合关系递归搜索,对每个满足条件的三角面片只搜索一次,因此大大提高了生成速度,其算法效率达到O(n);还容易识别出STL文件的裂缝等非正常情况,自动生成三维区域轮廓边界环.该算法已在光固化、选择性烧结快速成形等的支撑生成中得到应用,不仅计算速度得以提高,而且工艺质量大为改善,达到了很好的效果.The surface region picking up algorithm is slowly and inefficient based on 3-dimension model of STL file in traditional, and it＇s not easy to deal with the crack of STL model. A rapid recurrence search algorithm of picking up surface region is proposed. The algorithm improved the building rate highly because of using triangle adjacent and border overlapping to recurrence and only once searching for every eligible triangle. The algorithm efficiency is O（n）. It＇s able to easily identify the STL file cracks, and other non-normal conditions, it also auto build 3-dimension boundary rings of region contour. This algorithm was applied to support building of multi-rapid prototyping （about stereolithography, selected laser sintering）, the result proved the algorithm not only enhanced calculation speed but also improved process quality, and achieved good effect.

关 键 词：快速成形 STL模型 区域拾取 裂缝识别 递归算法 

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