A Quickly Solving Constrain Arithmetic in Virtual Die Assembly Design

摘要

In virtual die assembly design, The assembly design phase is very important and has great impacts on following work. The process of assembly design is solving process of that each parts according to assemble relation to carry on the assembly constrains. Using the traditional number method to solve assembly constrains, A large-scale non- line square set need to be carried out. Moreover this method is slowing efficient and probably not convergent. The paper defines the assembly modeling and assembly constrains for die and uses degree of freedom analysis solving assembly constrain correctively and effectively without requiring simultaneous solution of non-linear constraint equations. The approach cans also del with over-constrained and under-constrained effectively Automatic assembly design will be more easy by the approach.