Computer Science – Computational Geometry
Scientific paper
2011-06-30
Computer Science
Computational Geometry
6th CIRP Seminar on CAT, Enschede : Netherlands (1999)
Scientific paper
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 {\leq} n {\leq} 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.
Couétard Yves
Delos Vincent
Teissandier Denis
No associations
LandOfFree
Operations on polytopes: application to tolerance analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Operations on polytopes: application to tolerance analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Operations on polytopes: application to tolerance analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-34803