| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 440192 | Computer-Aided Design | 2011 | 10 Pages |
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 nn-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.
► We describe a method to compute Minkowski sum of 3-polytopes. ► This method is based exclusively on intersection operations on normal cones. ► 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. ► In tolerance analysis, this method is used to optimise the filling of a functional polytope by a calculated polytope.
