基于特征邻接图的三维CAD模型检索算法

石民; 张树生

基于特征邻接图的三维CAD模型检索算法

石民,
张树生

1.
西北工业大学现代设计与集成制造技术教育部重点实验室, 西安 710072

基金项目:

国家863计划项目(2007AA04Z137)资助

详细信息

作者简介:
石民(1970-)，博士研究生，研究方向为制造业信息化和模型搜索，shiminnpu@gmail.com;张树生(联系人)，教授，博士生导师，zssnet@nwpu.edu.cn

石民(1970-)，博士研究生，研究方向为制造业信息化和模型搜索，shiminnpu@gmail.com;张树生(联系人)，教授，博士生导师，zssnet@nwpu.edu.cn

计量
- 文章访问数: 185
- HTML全文浏览量: 25
- PDF下载量: 8
- 被引次数: 0
出版历程
- 收稿日期: 2011-07-05
- 刊出日期: 2015-06-10

A Method of 3D CAD Model Retrievalbased on Feature Adjacent Grahp

1.
The Key Laboratory of Contemporary Designing and Integrated Manufacturing Technology, Ministry of Education, Northwestern Polytechnical University, Xi'an 710072

摘要

摘要: 为了实现CAD模型的特征级重用,提出一种基于特征邻接图的三维CAD模型检索算法。首先,通过以自动识别为主、交互识别为辅,将CAD模型用特征邻接图来表示;然后,构造2个CAD模型特征邻接图的顶点积图,并利用蚁群算法检测顶点积图中的最大团;最后通过查找到的最大团来对CAD模型进行相似性评价。实验结果表明:本算法能较好地实现三维CAD模型检索,并且检索效率满足实际要求。
- 重用 /
- 模型检索 /
- 特征邻接图 /
- 最大团
Abstract: In order to reuse the 3D CAD model,a new method of 3D CAD model retrieval based on feature adjancent graph is proposed.First,a representation of feature adjancent graph（FAG） for the CAD model is extracted by automatic identification-based and interactive identification-assisted.Next,the vertex product graph of two CAD model's FAGS is constructed,and then the ant colony algorithm is employed to detect maximum-cliques in the vertex product graph.At last,the similarity of models is calculated by comparing the maximum-cliques.Experimental results show that this method can realize the 3D CAD model retrieval and its efficiency meets the requirements of applications.
- reuse /
- model retrieval /
- feature adjancent graph /
- maximum-clique

HTML全文

参考文献(11)

[1]	王洪申,张树生,白晓亮等.基于最有匹配的三维CAD模型相似性评价算法[J].计算机集成制造系统,2007,13(10):924～928
[2]	Gao W,Gao S M,Liu Y S,et al.Multiresolutional similarity as-sessment and retrieval of solid models based on DBMS[J].Computer-aided Design,2006,38(9):985～1001
[3]	王玉,马浩军,何玮等.机械3维CAD模型的聚类和检索[J].计算机集成制造系统,2006,12(6):924～928
[4]	Sunil V B,Agarwal R,Pande S S.An approach to recognize in-teractiong features from B-Rep CAD models of prismatic ma-chined parts using a hybrid(graph and rule based)technique[J].Computer in Industry,2010,61(7):686～701
[5]	Mcgregor J.Backtrack search algorithms and the maximal com-mon sub-graph problem[J].Software Practice and Experi-ence,1982,12(1):23～34
[6]	Durand P J,Pasari R,Baker J W,el at.An efficient algorithmfor similarity analysis of molecules[J].Internet Journal ofChemistry,1999,2(17):1352～1358
[7]	Balas E,Yu C S.Finding a maximum clique in an arbitrarygraph[J].SIAM Journal on Computing,1986,15(4):1054～1068
[8]	Koch I.Enumerating all connected maximal common subgraphsin two graphs[J].Theoretical Computer Science,2001,250(1):1～30
[9]	Fenet S,Solnon C.Searching for maximum cliques with ant colo-ny optimization[A].Evoworkshop'03 Proceedings of the 2003International Conference on Applications of EvolutionaryComputing[C],2003
[10]	Osada R,Funkhouser T,Chazelle B,et al.Shape distributions[J].ACM Transactions on Graphics,2002,21(4):807～832
[11]	Kazhdan M,Funkouser T,Rusinkiewicz S.Rotation invariantspherical harmonic representation of 3D shape descriptors[A].Proceedings of Symposium on Geometry Processing[C],Aachen,2003:156～164