检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈永府[1] 黄正东[1] 赵建军[1] 龚雄[1]
机构地区:[1]华中科技大学CAD中心,湖北武汉430074
出 处:《机械设计》2007年第9期15-18,共4页Journal of Machine Design
基 金:国家自然科学基金资助项目(50275060);国家863/现代集成制造系统技术主题资助项目(2003AA411044)
摘 要:相交特征的识别是自动特征识别的难点,提出一种新的基于图的特征识别算法,首先构造加工面邻接图(MFAG),然后通过特征匹配快速识别出孤立特征,通过特征面的延拓、求交与分割,主动找出特征痕迹,分解出基本特征子图,从而识别出相交特征。该算法使孤立特征和相交特征的识别模式统一,同时有利于与交互特征定义集成。The recognition of intersection features is a hard nut to crack in the automatic recognition of features. A new kind of algorithm of feature recognition based on graphs was put forward. Firstly the Machining Face Adjacency Graph (MFAG) was constructed and then the isolated features were rapidly recognized by means of matching of features. By way of prolongation, seeking intersection and partition of feature faces, the trace of feature was found out initiatively and the basic sub-graph of feature was decomposed, consequently recognized the intersection features. This algorithm makes the recognition patterns of isolated features and intersection features be unified and is advantageous in the definition and integration with the interactive features at the same time.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222