Operations on polytopes: application to tolerance analysis

Abstract : This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric constraints, a finite set of contact constraints and a finite set of functional constraints. Mathematically each constraint formalises a n-face (hyperplan of dimension n) of a n-polytope (1 ≤ n ≤ 6). Thus the relative position between two any surfaces of a mechanism can be calculated with two operations on polytopes : the Minkowski sum and the Intersection. The result is a new polytope: the calculated polytope. The inclusion of the calculated polytope inside the functional polytope indicates if the functional requirement is satisfied or not satisfied. Examples illustrate these numerical methods.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00604749
Contributor : Vincent Delos <>
Submitted on : Wednesday, June 29, 2011 - 3:57:46 PM
Last modification on : Thursday, January 11, 2018 - 6:21:23 AM
Long-term archiving on : Friday, September 30, 2011 - 2:23:50 AM

File

1999_CIRP_Twente_DTeissandier_...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00604749, version 1

Citation

Denis Teissandier, Vincent Delos, Yves Couétard. Operations on polytopes: application to tolerance analysis. 6th CIRP Seminar on CAT, Mar 1999, Enschede, Netherlands. pp.425-433. ⟨hal-00604749v1⟩

Share

Metrics

Record views

16

Files downloads

36