Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
A 2015 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: