采用图分解的特征识别算法研究.PDF

2010 年 工 程 图 学 学 报 2010 第1 期 JOURNAL OF ENGINEERING GRAPHICS No.1 采用图分解的特征识别算法研究 刘晓平， 吴 敏， 金 灿 （合肥工业大学计算机与信息学院，安徽 合肥 230009 ） 摘 要： CAD/CAE 模型转换，其关键在于如何将模型分解为最简单元，这些单元 往往具有相近的网格划分属性，可以方便估计计算误差和计算时间。基于此提出了基于图分 解的特征识别算法，对属性邻接图进行分解，根据分解后的属性邻接图中的连通分量生成体 特征。该算法不再局限于特征类型，只要合理控制顶点的可分解性判断就可以得到期望的模 型分解结果；同时该算法可以获得体特征，使得可以在特征这一粒度上进行特征删除和替换， 以方便地完成模型的简化。 关 键 词：计算机应用；特征识别；体特征；图分解 中图分类号：TP 391 文献标识码：A 文 章 编 号：1003-0158(2010)0 1-0067-05 Study on Feature Recognition Algorithm Based on Graph Decomposition LIU Xiao-ping, WU Min, JIN Can ( School of Computer and Information, Hefei University of Techonology, Hefei Anhui 230009, China ) Abstract: The key problem of CAD/CAE model transformation lies in how to decompose models to the simplest elements. Such element owns similar gridding property which can weigh computing error and time. And for this reason this paper proposed a feature recognition algorithm based on graph decomposition and decomposed the attributed adjacent graphs to many connectivity components, and then formed the volumetric feature in terms of these connectivity components. This algorithm is not limited to the feature type; it would return a desired result of model decomposition only if the resolvability of the vertex is controlled reasonably. And meanwhile, by using this algorithm we could acquire entity characteristics and remove or replace feature in the level of characteristics, which can simplify the model conveniently. Key words: computer application; feature recognition; volumetric feature; graph decomposition CAD/CAE/CA