论文信息 - Minkowski sum of polytopes defined by their vertices

Minkowski sum of polytopes defined by their vertices

Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in [1]. Our approach is based on the use of linear programming and is solvable in polynomial time. The algorithm we developed can be implemented and parallelized in a very easy way.

Denis Teissandier | Vincent Delos | D. Teissandier | V. Delos

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

[2] Denis Teissandier,et al. Minkowski sum of HV-polytopes in Rn , 2014, ArXiv.

[3] Lazhar Homri,et al. Tolerancing Analysis by Operations on Polytopes , 2013 .

[4] Denis Teissandier,et al. Algorithm to calculate the Minkowski sums of 3-polytopes based on normal fans , 2011, Comput. Aided Des..

[5] K. Fukuda,et al. Computing All Faces of the Minkowski Sum of V-Polytopes , 2005 .

[6] Christophe Weibel,et al. Minkowski sums of polytopes , 2007 .

[7] K. Fukuda. Frequently Asked Questions in Polyhedral Computation , 2000 .

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