Denis Teissandier
University of Bordeaux
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Denis Teissandier.
Computer-aided Design | 1999
Denis Teissandier; Yves Couétard; Alain Gérard
Abstract The object of this article is to present a tolerancing model, the “Proportioned Assembly Clearance Volume: PACV”. The finality of the PACV is to create a three-dimensional (3D) tolerancing analysis tool that takes into account only standardized specifications. The PACV is based on the Small Displacements Torsor (SDT) concept. SDT is used to express the relative position between two ideal surfaces. The rotations between two geometric features are linearized, i.e. displacements are transformed into small displacements. An ideal surface is a surface, which can be characterized by a finite number of geometric features: point, centerline, part face, etc. A nominal surface is an ideal surface by definition. By modeling fabricated surfaces in ideal surfaces, it is possible to compute the limits of small displacements of a fabricated surface inside a tolerance zone. The values of these limits define a PACV. With a similar method, the limits of small displacements between two surfaces of two distinct parts, e.g. clearance in a joint, can be determined: they define a PACV. Using a graph, we illustrate how PACV (edges) could be associated in series or in parallel between two any surfaces (vertices) in an assembly, in order to create 3D dimension-chains. The governing rule of PACV in series is introduced. In addition, one example of computation of 3D dimension-chain (result of an association of PACV in series) is presented.
arXiv: Computational Geometry | 1999
Denis Teissandier; Vincent Delos; Yves Couétard
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 fmite 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.
Computer-aided Design | 2011
Denis Teissandier; Vincent Delos
Prompted by the development of algorithms for analysing geometric tolerancing, this article describes a method to determine the Minkowski sum for 3-dimensional polytopes. This 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. The basic properties of the algorithms can be applied to n-polytopes. 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. Lastly, there is a discussion of the features of this algorithm, developed using the OpenCascade environment.
Journal of Computing and Information Science in Engineering | 2017
Santiago Arroyave-Tobón; Denis Teissandier; Vincent Delos
This article proposes the use of polytopes in
Archive | 2013
Lazhar Homri; Denis Teissandier; Alex Ballu
\mathcal{HV}
Journal of Applied Mathematics and Physics | 2015
Vincent Delos; Denis Teissandier
-description to solve tolerance analysis problems. Polytopes are defined by a finite set of half-spaces representing geometric, contact or functional specifications. However, the list of the vertices of the polytopes are useful for computing other operations as Minkowski sums. Then, this paper proposes a truncation algorithm to obtain the
arXiv: Computational Geometry | 2015
Vincent Delos; Denis Teissandier
\mathcal{V}
Archive | 2007
Alex Ballu; Jérôme Dufaure; Denis Teissandier
-description of polytopes in
International Joint Conference on Mechanics, Design Engineering & Advanced Manufacturing (JCM 2016) | 2017
Vincent Delos; Denis Teissandier; Santiago Arroyave-Tobón
\mathbb{R}^n
Archive | 1998
Denis Teissandier; Yves Couétard; Alain Gérard
from its