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]
@inproceedings{DasDS21,
title = {A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes},
author = {Sandip Das 0001 and Subhadeep Ranjan Dev and Swami Sarvottamananda},
year = {2021},
doi = {10.1007/978-3-030-67899-9_14},
url = {https://doi.org/10.1007/978-3-030-67899-9_14},
researchr = {https://researchr.org/publication/DasDS21},
cites = {0},
citedby = {0},
pages = {179-195},
booktitle = {Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings},
editor = {Apurva Mudgal and C. R. Subramanian},
volume = {12601},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-67899-9},
}