基于信息继承的可连轮廓组快速提取算法  

An Algorithm for Rapid Recognition of Outlines Group Based on Information Inheriting

作　　者：马良[1] 黄卫东[1] 

机构地区：[1]西北工业大学凝固技术国家重点实验室,西安710072

出　　处：《机械科学与技术》2009年第4期482-486,共5页Mechanical Science and Technology for Aerospace Engineering

基　　金：国家自然科学基金重点项目(50331010)资助

摘　　要：针对金属激光立体成形的剖分过程,本文提出了一种可连轮廓组的快速提取算法。该算法通过利用分组矩阵减小切片平面与三角面片的相交检测次数,其时间复杂性为O(n);使用三角面片的局部拓扑重构算法,通过依次追踪毗邻三角面片,快速完成切片平面与三角面片的求交过程,不产生冗余交点。在此基础上,充分利用第i层的三角面片拓扑信息和轮廓环间的包含关系,对第i+1层的可连轮廓组提取算法进行了加速,最好情况下可在O(n)时间内完成可连轮廓组的提取。基于上述算法,应用Visual C++6.0和开放式图形接口OpenGL,在Windows XP平台上开发了具有自主知识产权的分层处理软件,实践检验该算法稳定、高效。We present an algorithm for constructing the outlines group of STL （stereolithography） model in respect of the slicing process of metal laser solid forming （MLSF）. By utilizing grouping matrix, the number of detecting intersection between a slicing plane and triangles are reduced with O（n） time complexity, where n is the number of triangular facets. Through local topology reconstruction and tracking of the adjacent triangular facets, intersections between a slicing plane and triangles can be calculated rapidly without redundant intersection. An accelerated algorithm for establishing level i ＋ 1 outlines group is thus proposed by taking into account the facets topology information and the relationship between outlines at level i. The outlines group, under ideal circumstances, can be established within O（n） time complexity. Based on the algorithm which is proved to be stable and efficient, the software was developed by using Visual C ＋ ＋ 6. 0 and OpenGL under Windows XP system.

关 键 词：金属激光立体成形 激光快速成形 剖分 可连轮廓组 三角面片 

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