Earticle

초록

영어

Constraint solving is widely applied to many fields including computer aided design, 2 dimension (2D) model design and computer aided manufacturing. Geometric constraint solution is a difficult problem because there are a large number of entities and related parameters in 2D sketches. In this paper, a new method which decomposes geometric constraint relations based on entity-parameter graphs is proposed for reducing the size of constraint solution. A geometric constraint problem is decomposed into many independent sub-problems. Then, particle swarm optimization algorithm is used to solve constraint equations in each sub-problem. Solutions of all sub-problems are integrated to obtain the original problem’s solution. In experiments, the proposed method is applied to HUST-CAID system. Experimental results show that the method can effectively solve 2 dimension geometric constraints.

목차

Abstract
 1. Introduction
 2. Decompose Geometric Constraints based on Entity-parameter Graphs
 3. Geometric Constraint Solving
 4. Experiment
 5. Conclusions
 Acknowledgements
 References

키워드

저자

• Xue-Yao Gao [ School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China ]
• Chun-Xiang Zhang [ School of Software, Harbin University of Science and Technology, Harbin 150080, China ]
• Zhi-Mao Lu [ School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605