This preview shows page 1. Sign up to view the full content.
Unformatted text preview: er pk in parts from Pi to Pj i. Find the two transformations that depend on pk. ii. Apply each transformation on u. iii. Sum the derivatives of the previous step for the kth column of Su. Output: Sensitivity matrices of part vertices Table 1. Algorithm for computing the sensitivity matrix of Pj relative to Pi Graph nodes correspond to parts and undirected edges correspond to constraints between parts. Edge weights are 1, 2, or 3, and indicate the number of degrees of freedom constrained between the two parts. The edge data structure holds additional information about each constraint, such as the feature names of parts A and B, the value or parametric expression of the distance between these features, and the type of constraint. Figure 3 shows the assembly graph of the assembly in Figure 1. The assembly specification is well-constrained if it is both complete and non-redundant. The specification is complete if for every assembly instance the relative position of all pairs can be determined from the constraints. It is non-redundant if the removal of any constraint results in incompleteness. Our framework only supports well-constrained assemblies. A necess...
View Full Document
This note was uploaded on 08/03/2010 for the course DD 1234 taught by Professor Zczxc during the Spring '10 term at Magnolia Bible.
- Spring '10
- The Land