A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes.
Sandip DasSubhadeep Ranjan DevSwami SarvottamanandaPublished in: CALDAM (2021)
Keyphrases
- worst case
- convex hull
- optimal solution
- dynamic programming
- average case
- np hard
- piecewise linear
- computational complexity
- detection algorithm
- globally optimal
- lower bound
- times faster
- error bounds
- cost function
- k means
- exhaustive search
- upper bound
- learning algorithm
- distance function
- running times
- worst case analysis
- graph cuts
- approximation algorithms
- search space
- high dimensional
- face recognition