In mechanical design, tolerance zones and contact gaps can be represented by sets of geometric constraints. For computing the accumulation of possible manufacturing defects, these sets have to be summed and/or intersected according to the assembly architecture. The advantage of this approach is its robustness for treating even over-constrained mechanisms i.e. mechanisms in which some degrees of freedom are suppressed in a redundant way. However, the sum of constraints, which must be computed when simulating the accumulation of defects in serial joints, is a very time-consuming operation. In this work, we compare three methods for summing sets of constraints using polyhedral objects. The difference between them lie in the way the degrees of freedom (DOFs) (or invariance) of joints and features are treated. The first method proposes to virtually limit the DOFs of the toleranced features and joints to turn the polyhedra into polytopes and avoid manipulating unbounded objects. Even though this approach enables to sum, it also introduces bounding or cap facets which increase the complexity of the operand sets. This complexity increases after each operation until becoming far too significant. The second method aims to face this problem by cleaning, after each sum, the calculated polytope to keep under control the effects of the propagation of the DOFs. The third method is new and based on the identification of the sub-space in which the projection of the operands are bounded sets. Calculating the sum in this sub-space allows reducing significantly the operands complexity and consequently the computational time. After presenting the geometric properties on which the approaches rely, we demonstrate them on an industrial case. Then we compare the computation times and deduce the equality of the results of all the methods.
A Characterization of the Existence of a Fundamental Bounded Resolution for the Space Cc(X) in Terms of X
