Algorithm to calculate the Minkowski sums of 3-polytopes based on normal fans

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.

[1]  Mariette Yvinec,et al.  Algorithmic geometry , 1998 .

[2]  Joseph K. Davidson,et al.  A New Mathematical Model for Geometric Tolerances as Applied to Round Faces , 2002 .

[3]  Gershon Elber,et al.  Offsets, sweeps, and Minkowski sums , 1999, Comput. Aided Des..

[4]  Utpal Roy,et al.  Representation and interpretation of geometric tolerances for polyhedral objects. II.: Size, orientation and position tolerances , 1999, Comput. Aided Des..

[5]  Tibor Steiner,et al.  Minkowski sum boundary surfaces of 3D-objects , 2007, Graph. Model..

[6]  Aristides A. G. Requicha,et al.  Toward a Theory of Geometric Tolerancing , 1983 .

[7]  Pijush K. Ghosh,et al.  A unified computational framework for Minkowski operations , 1993, Comput. Graph..

[8]  Dan Halperin,et al.  On the Exact Maximum Complexity of Minkowski Sums of Polytopes , 2009, Discret. Comput. Geom..

[9]  Friedrich Eisenbrand,et al.  Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently , 2009, Discret. Comput. Geom..

[10]  G. Ewald.  Combinatorial Convexity and Algebraic Geometry , 1996 .

[11]  Florence Denis,et al.  Contributing vertices-based Minkowski sum computation of convex polyhedra , 2009, Comput. Aided Des..

[12]  Denis Teissandier,et al.  Operations on polytopes: application to tolerance analysis , 2011, ArXiv.

[13]  G. Ziegler.  Lectures on Polytopes , 1994 .

[14]  Peter Gritzmann,et al.  Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Basis , 1993, SIAM J. Discret. Math..

[15]  Alan Fleming,et al.  Geometric Relationships Between Toleranced Features , 1988, Artif. Intell..

[16]  Rafael Mulero,et al.  Two-dimensional Minkowski sum optimization of ganged stamping blank layouts for use on pre-cut sheet metal for convex and concave parts , 2007 .

[17]  Komei Fukuda,et al.  From the zonotope construction to the Minkowski addition of convex polytopes , 2004, J. Symb. Comput..

[18]  Joseph K. Davidson,et al.  Improvements to algorithms for computing the Minkowski sum of 3-polytopes , 2003, Comput. Aided Des..

[19]  Jyh-Ming Lien,et al.  Covering Minkowski sum boundary using points with applications , 2008, Comput. Aided Geom. Des..

[20]  Jean-Pierre Nadeau,et al.  Integration of thermomechanical strains into tolerancing analysis , 2009 .

[21]  Dinesh Manocha,et al.  Accurate Minkowski sum approximation of polyhedral models , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[22]  Dan Halperin,et al.  Exact and efficient construction of Minkowski sums of convex polyhedra with applications , 2006, Comput. Aided Des..

[23]  Jean-Daniel Boissonnat,et al.  Slicing Minkowski sums for satellite antenna layout , 1998, Comput. Aided Des..