期刊文献+

基于面上下文码匹配的CAD模型检索方法 被引量:1

CAD model retrieval based on face context code matching
下载PDF
导出
摘要 为弥补现有的基于图的形状描述应用图匹配或子图匹配实现CAD模型检索时,存在着检索效率低下或检索结果不够准确的缺陷,提出一种基于面上下文码匹配的CAD模型检索方法。提取CAD模型的B-rep信息生成面属性邻接图;依据面的上下文邻接关系,将模型面属性邻接图转化为上下文层状面属性邻接图,生成面上下文码;由检索模型与数据库模型的面上下文码匹配排除筛选不匹配的面,得到与检索模型相匹配的面。实验结果表明,该方法能够实现CAD模型的整体和局部检索,并且检索效率和精准程度能够满足实际需要。 A CAD model retrieval approach based on face context code matching is presented in order to resolve the prob-lem that graph matching or subgraph matching realizing the CAD model retrieval for graph-based model descriptions may not be effective and accurate enough. A representation of Face Adjacency Graph(FAG)for each CAD model is extracted from its B-rep model. According to the face context relation, the FAG is transformed to a layered configuration and face context codes are constructed. The comparison of face context codes between retrieval model and data models is adopted to exclude and screen the unmatched faces. Experimental results show that this method is able to support CAD model retrieval and its efficiency and accuracy meet the requirement of practical applications.
出处 《计算机工程与应用》 CSCD 2014年第3期1-5,共5页 Computer Engineering and Applications
基金 湖北省教育厅科研项目(No.B2013229)
关键词 面上下文码 模型检索 面属性邻接图 子图匹配 face context code model retrieval face adjacency graph subgraph matching
  • 相关文献

参考文献12

二级参考文献77

  • 1郑伯川,彭维,张引,叶修梓,张三元.3D模型检索技术综述[J].计算机辅助设计与图形学学报,2004,16(7):873-881. 被引量:66
  • 2崔晨旸,石教英.三维模型检索中的特征提取技术综述[J].计算机辅助设计与图形学学报,2004,16(7):882-889. 被引量:65
  • 3潘翔,张三元,张引,叶修梓.一种基于拓扑连接图的三维模型检索方法[J].计算机学报,2004,27(9):1250-1255. 被引量:22
  • 4杨育彬,林珲,朱庆.基于内容的三维模型检索综述[J].计算机学报,2004,27(10):1297-1310. 被引量:95
  • 5邹潇湘,戴琼.图同构中的一类顶点细分方法[J].软件学报,2007,18(2):213-219. 被引量:6
  • 6Sinkhorn R. A relationship between arbitrary positive matrices and doubly stochastic matrices [J]. The Annals of Mathematical Statistics, 1964, 35(2): 876-879.
  • 7Gao S, Shah J J. Automatic recognition of interacting machining features based on minimal condition subgraph [J]. Computer Aided Design, 1998, 30(9): 727-739.
  • 8Gold S, Rangarajan A. A graduated assignment algorithm for graph matching [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1996, 18(4): 377-388.
  • 9Geiger D, Girosi F. Parallel and deterministic algorithms from MRF's: surface reconstruction [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1991, 13 (5): 401-412.
  • 10Ullmann J R. An algorithm for subgraph isomorphism [J]. Journal of the Association for Computing Machinery, 1976, 23(1) : 31-42.

共引文献87

同被引文献10

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部