Model reduction in geometric tolerancing by polytopes

Abstract There are several models used in mechanical design to study the behaviour of mechanical systems involving geometric variations. By simulating defects with sets of constraints it is possible to study simultaneously all the configurations of mechanisms, whether over-constrained or not. Using this method, the accumulation of defects is calculated by summing sets of constraints derived from features (toleranced surfaces and joints) in the tolerance chain. These sets are usually unbounded objects ( R 6 -polyhedra, 3 parameters for the small rotation, 3 for the small translation), due to the unbounded displacements associated with the degrees of freedom of features. For computational and algorithmic reasons, cap facets are introduced into the operand polyhedra to obtain bounded objects ( R 6 -polytopes) and facilitate computations. However, the consequence is an increase in the complexity of the models due to the multiplication of caps during the computations. In response to this situation, we formalized and tested a method for controlling the effects of cap facets. Based on the combinatorial properties of polytopes, we propose to trace the operand faces during the different operations. An industrial case is solved and discussed in order to show the significant gain in computational time when applying the new method. This example has been chosen to be as general as possible to illustrate the genericity of the method.

[1]  Joseph K. Davidson,et al.  Improvements to algorithms for computing the Minkowski sum of 3-polytopes , 2003, Comput. Aided Des..

[2]  Lazhar Homri,et al.  Tolerance analysis by polytopes: Taking into account degrees of freedom with cap half-spaces , 2015, Comput. Aided Des..

[3]  Dan Halperin,et al.  Exact and efficient construction of Minkowski sums of convex polyhedra with applications , 2007, Comput. Aided Des..

[4]  Denis Teissandier,et al.  Tolerance Analysis With Polytopes in HV-Description , 2016, J. Comput. Inf. Sci. Eng..

[5]  Joseph K. Davidson,et al.  Comparison of Two Similar Mathematical Models for Tolerance Analysis: T-Map and Deviation Domain , 2013 .

[6]  Alan Fleming,et al.  Geometric Relationships Between Toleranced Features , 1988, Artif. Intell..

[7]  R. Arrieux,et al.  Clearance Space in Volumic Dimensioning , 1992 .

[8]  Doriane Gouyou,et al.  Tolerance analysis of overconstrained and flexible assemblies by polytopes and finite element computations: application to a flange , 2017, Research in Engineering Design.

[9]  Dinesh Manocha,et al.  Accurate Minkowski sum approximation of polyhedral models , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[10]  Gaurav Ameta,et al.  Comparison of Spatial Math Models for Tolerance Analysis: Tolerance-Maps, Deviation Domain, and TTRS , 2011, J. Comput. Inf. Sci. Eng..

[11]  Komei Fukuda,et al.  Combinatorial Face Enumeration in Convex Polytopes , 1994, Comput. Geom..

[12]  Denis Teissandier,et al.  Minkowski sum of polytopes defined by their vertices , 2014, ArXiv.

[13]  Joseph K. Davidson,et al.  Navigating the Tolerance Analysis Maze , 2007 .

[14]  Raimund Seidel,et al.  How Good Are Convex Hull Algorithms? , 1997, Comput. Geom..

[15]  Christophe Weibel MINKOWSKI SUMS OF POLYTOPES : COMBINATORICS AND COMPUTATION , 2007 .

[16]  Paul Clozel,et al.  MECAmaster: A Tool for Assembly Simulation from Early Design, Industrial Approach , 2013 .

[18]  Denis Teissandier,et al.  Operations on polytopes: application to tolerance analysis , 2011, ArXiv.

[19]  Philippe Serré,et al.  A Declarative Information Model for Functional Requirements , 1996 .

[20]  Joseph K. Davidson,et al.  A New Mathematical Model for Geometric Tolerances as Applied to Round Faces , 2002 .

[21]  Denis Teissandier,et al.  Algorithm to calculate the Minkowski sums of 3-polytopes based on normal fans , 2011, Comput. Aided Des..

[22]  Tibor Steiner,et al.  Minkowski sum boundary surfaces of 3D-objects , 2007, Graph. Model..

[23]  Komei Fukuda,et al.  From the zonotope construction to the Minkowski addition of convex polytopes , 2004, J. Symb. Comput..