Minkowski Sum of Polytopes Defined by Their Vertices

12/08/2014
by   Vincent Delos, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2021

A Polynomial-Time Algorithm for Special Cases of the Unbounded Subset-Sum Problem

The Unbounded Subset-Sum Problem (USSP) is defined as: given sum s and a...
research
07/28/2020

A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs

We give a polynomial-time algorithm for detecting very long cycles in de...
research
08/11/2023

A Better-Than-1.6-Approximation for Prize-Collecting TSP

Prize-Collecting TSP is a variant of the traveling salesperson problem w...
research
06/06/2023

A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems

Linear programming (LP) problems with gainfree Leontief substitution sys...
research
04/16/2020

A polynomial time algorithm for solving the closest vector problem in zonotopal lattices

In this note we give a polynomial time algorithm for solving the closest...
research
06/14/2020

High-precision Wasserstein barycenters in polynomial time

Computing Wasserstein barycenters is a fundamental geometric problem wit...
research
04/18/2021

Provably Safe Tolerance Estimation for Robot Arms via Sum-of-Squares Programming

Tolerance estimation problems are prevailing in engineering applications...

Please sign up or login with your details

Forgot password? Click here to reset