A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes

Sandip Das 0001, Subhadeep Ranjan Dev, Swami Sarvottamananda. A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes. In Apurva Mudgal, C. R. Subramanian, editors, Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings. Volume 12601 of Lecture Notes in Computer Science, pages 179-195, Springer, 2021. [doi]

Abstract

Abstract is missing.