Partial Matching of 3D CAD Models with Attributed Graph

Article Preview

Abstract:

This paper presents an algorithm for matching similar sub-parts of 3D CAD models. The matching process is based on the attributed graphs. Each model in target object database is represented by attributed graph. The sub-part, which is to be retrieved, is selected interactively by users from a 3D CAD model described by boundary representation (B-Rep) and its attributed graph is automatically generated. For each target CAD model in the database, its surfaces which are similar to those surfaces of the query sub-part are identified by means of the attributes. Then, other irrelevant surfaces of the target object are deleted from the model’s attributed graph. Thus, the parts that are possibly similar to the query sub-part are separated from the target model. A method for calculating the similarity coefficient between the separated part and the sub-part, which uses an optimal matching algorithm for bi-graphs, is proposed. Experimental results show that this algorithm can efficiently achieve partial retrieval.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

302-309

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Osada R, Funkhouser T, Chazelle B, et al. Shape distributions. ACM Transactions on Graphics, 21(2002) 807–832.

DOI: 10.1145/571647.571648

Google Scholar

[2] Chen DY, Tian XP, Shen YT, et al. On visual similarity based 3D model retrieval. [2006-06-10] http: /graphics. csie. ntu. edu. tw/~edwards/DYChen_EG03. pdf.

Google Scholar

[3] El-Mehalawi M, Miller R A. A database system of mechanical components based on geometric and topological similarity. part II: indexing, retrieval, matching and similarity assessment. Computer-Aided Design, 35(2003) 95–105.

DOI: 10.1016/s0010-4485(01)00178-6

Google Scholar

[4] Sun Xiaopeng, Li Hua. 3D shape description with principal curve. Journal of Computer-aided Design & Computer Graphics, 18(2006) 14-20. (in Chinese).

Google Scholar

[5] Marini S, Biasotti S, Falcidieno B. Partial matching by structural descriptors. [2007-08-31] http: /drops. dagstuhl. de/opus/volltexte/2006/651.

Google Scholar

[6] Gal R, Cohen-Or D. Salient geometric features for partial shape matching and similarity. [2007-08-31] http: /www. cs. princeton. edu/~funk/sgp06. pdf.

Google Scholar

[7] Funkhouser T, Shilane P. Partial matching of 3D shapes with priority-driven search. http: /www. cs. tau. ac. il/~galran/papers/salient/salient-reduced. pdf.

Google Scholar

[8] Sedgewick R. Algorithms in C++, Part 5: Graph Algorithms. third Edition. Pearson Education Asia Limited and Tsinghua University Press, (2003).

Google Scholar

[9] Shun Huiquan. Graph and Its Applications. Beijing: Science Press, (2004).

Google Scholar

[10] Information on http: /www. opencascade. org.

Google Scholar