Algorithm to calculate the Minkowski sums of 3-polytopes dedicated to tolerance analysis - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Algorithm to calculate the Minkowski sums of 3-polytopes dedicated to tolerance analysis

Denis Teissandier
  • Fonction : Auteur
  • PersonId : 843389
Vincent Delos

Résumé

Prompted by the development of algorithms for analysing geometric tolerancing, this article describes a method to determine the Minkowski sum for 3-dimension polytopes. This purposed method is based exclusively on intersection operations on normal cones, using the properties of the normal fan of a Minkowski sum obtained by common refinement of the normal fans of the operands. It can be used to determine from which vertices of the operands the vertices of the Minkowski sum derive. It is also possible to determine to which facets of the operands each facet of the Minkowski sum is oriented. First, the main properties of the duality of normal cones and primal cones associated with the vertices of a polytope are described. Next, the properties of normal fans are applied to define the vertices and facets of the Minkowski sum of two polytopes. An algorithm is proposed which generalises the method. An example shows the application of the method on an assembly made up of two parts. Lastly, there is a discussion of the features of this algorithm, developed using the OpenCascade environment.
Fichier principal
Vignette du fichier
155.pdf (1.73 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00694163 , version 1 (07-05-2012)

Identifiants

  • HAL Id : hal-00694163 , version 1

Citer

Denis Teissandier, Vincent Delos. Algorithm to calculate the Minkowski sums of 3-polytopes dedicated to tolerance analysis. IMProVe International Conference 2011, Jun 2011, Venice, Italy. pp.521-531. ⟨hal-00694163⟩
150 Consultations
286 Téléchargements

Partager

Gmail Facebook X LinkedIn More