-
2
- #1
bloodclot
Mechanical
- Jan 5, 2006
- 135
I found this question and answer on the SW website and thought it was good mate information. Kind of like "Mates Explained" or "Mates for Dummies" summary. Most of the time I feel like I fall into the "Dummies" category anyway. I hope someone will find this useful other than me.
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
The processing of the mate group follows a sequence:
Parse the mate group to identify the order in which the mates need to be processed taking account of the interdependencies between the components / sub-assemblies.
Process the mate group in the order derived by the parse process.
Verify the validity of the processed mates.
If errors are found process the mates again in the order derived from the parse operation.
Verify a good result and if not raise warnings / errors.
Note as a change may be introduced for many reasons the mate group is processed each time a component is added to the assembly or moved in addition to the process of adding a mate.
General comments on mates:
The time to solve a mate group has a squared rather than linear relationship with the number of mates to be processed.
The parsing process must take account of the possibility of an over-defining mating situation. In the simplest case consider 2 rectangular blocks. With one block fixed in space we can add three co-incident face relationships to position the second block next to the fixed block. Without these mates the second block can move with 6 degrees of freedom. Position in space – x,y an z plus a rotation about these axes – Roll, pitch and yaw. Adding a single coincident face to face mate removes three degrees of freedom, one positional degree and two rotations. Adding the required three coincident face to face relationships would remove a total of 9 degrees of freedom and hence the mating scheme is over-defined. The mating parse will recognize this as a valid over-defined situation in simple cases. With more complicated mating schemes where the mate sequence relates through a number of components, recognition of this particular situation can become even more complicated if a mate is referenced to a patterned component. The mating scheme must position the source component(s). These would then be patterned and a new mating scheme derived for the post patterning operation. The number of possible solutions will increase in this situation.
Often performance will fall dramatically if a true over-defining case occurs. In this situation there is no valid solution to the mate parsing process and as such the program will select the least bad solution. In order to derive the least bad solution all possible mating schemes will be considered. In large mating schemes the parsing process will take a considerable time.
Credit to SW for this explanation of mates!
Bloodclot
What do you see when the Pillsbury Dough Boy bends over?
Doughnuts
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
The processing of the mate group follows a sequence:
Parse the mate group to identify the order in which the mates need to be processed taking account of the interdependencies between the components / sub-assemblies.
Process the mate group in the order derived by the parse process.
Verify the validity of the processed mates.
If errors are found process the mates again in the order derived from the parse operation.
Verify a good result and if not raise warnings / errors.
Note as a change may be introduced for many reasons the mate group is processed each time a component is added to the assembly or moved in addition to the process of adding a mate.
General comments on mates:
The time to solve a mate group has a squared rather than linear relationship with the number of mates to be processed.
The parsing process must take account of the possibility of an over-defining mating situation. In the simplest case consider 2 rectangular blocks. With one block fixed in space we can add three co-incident face relationships to position the second block next to the fixed block. Without these mates the second block can move with 6 degrees of freedom. Position in space – x,y an z plus a rotation about these axes – Roll, pitch and yaw. Adding a single coincident face to face mate removes three degrees of freedom, one positional degree and two rotations. Adding the required three coincident face to face relationships would remove a total of 9 degrees of freedom and hence the mating scheme is over-defined. The mating parse will recognize this as a valid over-defined situation in simple cases. With more complicated mating schemes where the mate sequence relates through a number of components, recognition of this particular situation can become even more complicated if a mate is referenced to a patterned component. The mating scheme must position the source component(s). These would then be patterned and a new mating scheme derived for the post patterning operation. The number of possible solutions will increase in this situation.
Often performance will fall dramatically if a true over-defining case occurs. In this situation there is no valid solution to the mate parsing process and as such the program will select the least bad solution. In order to derive the least bad solution all possible mating schemes will be considered. In large mating schemes the parsing process will take a considerable time.
Credit to SW for this explanation of mates!
Bloodclot
What do you see when the Pillsbury Dough Boy bends over?
Doughnuts