A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes.
Sandip DasSubhadeep Ranjan DevSwami SarvattomanandaPublished in: Discret. Appl. Math. (2024)
Keyphrases
- worst case
- dynamic programming
- convex hull
- optimal solution
- computational complexity
- average case
- error bounds
- globally optimal
- learning algorithm
- space complexity
- upper bound
- times faster
- piecewise linear
- minkowski sum
- worst case analysis
- running times
- approximation algorithms
- simulated annealing
- similarity measure
- greedy algorithm
- np hard
- global optimality
- extreme points
- image processing