Semantic Feature Modeling Based on the Decomposition of Feature Dependent Graph

Article Preview

Abstract:

Semantic feature modeling is an important research topic in CAD, in which geometric constraints in model are solved automatically. A semantic feature modeling method is given in this paper. Firstly, the feature dependent graph is built based on geometric constraints. Secondly, the feature dependent graph is decomposed according to the complexity of subgraphs and the whole problem of solving geometric constraints is divided into several small ones. Thirdly, these small problems are solved. At the same time, the modeling architecture based on the decomposition of feature dependent graph is given. Experimental results show that when the proposed method is applied, the modeling performance is improved.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

149-152

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Zhiliang Shi, Zhongquan Zhang and Yi Chen. A united modeling method of generalized geometric constraint system. In Proceedings of the 3rd International Conference on Intelligent System Design and Engineering Applications. 2013: 204~208.

DOI: 10.1109/isdea.2012.54

Google Scholar

[2] Chunhong Cao, Bin Zhang, Limin Wang and Wenhui Li. On geometric constraint solving based on the immune neural network. In Proceedings of the 27th Chinese Control Conference. 2008: 536~540.

DOI: 10.1109/chicc.2008.4605359

Google Scholar

[3] Dominique Michelucci and Sebti Foufou. Interrogating witnesses for geometric constraint solving. In Proceedings of SPM 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling. 2009: 343~348.

DOI: 10.1145/1629255.1629301

Google Scholar

[4] Vaibhav Kale, Vikram Bapat and Bernie Bettig. Geometric constraint solving with solution selectors. In Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. 2009: 353~365.

DOI: 10.1115/detc2008-50113

Google Scholar

[5] Iddo Hanniel and Kirk Haller. Solving global geometric constraints on free-form curves. In Proceedings of SPM 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling. 2009: 307~312.

DOI: 10.1145/1629255.1629295

Google Scholar

[6] Chunhong Cao, Limin Wang and Wenhui Li. The geometric constraint solving based on the quantum particle swarm. In Proceedings of the 5th International Conference RSKT. 2010: 582~587.

DOI: 10.1007/978-3-642-16248-0_79

Google Scholar

[7] Hilderick A Van Der Meiden. Solving systems of 3D geometric constraints with non-rigid clusters. In Proceedings of the 2008 Advances in Geometric Modeling and Processing. 2008: 423~436.

DOI: 10.1007/978-3-540-79246-8_32

Google Scholar

[8] Youhua Zhang, Kunqi Liu and Gang Liu. A concurrent-hybrid evolutionary algorithm for geometric constraint solving. In Proceedings of Computational Intelligence and Intelligent Systems. 2010: 1~10.

DOI: 10.1007/978-3-642-16388-3_1

Google Scholar

[9] Hua Yuan and Chunjiang Yu. Optimization genetic algorithm for geometric constraint solving. In Proceedings of 2010 International Conference on Artificial Intelligence and Education. 2010: 590~593.

DOI: 10.1109/icaie.2010.5641455

Google Scholar

[10] Chunhua He, Xiangwei Zhang and Wenge Lv. A new approach for solving geometric constraint based on election-survey algorithm. In Proceedings of 2010 International Conference on Computer, Mechatronics, Control and Electronic Engineering. 2010: 427~430.

DOI: 10.1109/cmce.2010.5610530

Google Scholar