Close this search box.

Exact Minkoski Sums of Polygons With Holes


The running time of the three new methods,
The running time of the three new methods, which can handle polygons with holes fed with pairs of general polygons with \(n\) vertices and \(n/10\) holes. The \(n\)-axis indicates the time in seconds. RC—reduced convolution, TD—constrained triangulation decomposition, VD—vertical decomposition.

We present an efficient algorithm that computes the Minkowski sum of two polygons, which may have holes. The new algorithm is based on the convolution approach. We also present a simple theorem, related to the Minkowski sum of polygons with holes, exploited by the new algorithm. We introduce a robust implementation of the new algorithm, which follow the Exact Geometric Computation paradigm and thus guarantees exact results. We also present an empirical comparison of the performance of Minkowski sum constructions, where we show that the implementation of the new algorithm exhibits better performance then all other implementations in many cases. In particular, we compared the implementation of the new algorithm, an implementation of the standard convolution algorithm, and an implementation of the decomposition approach using various convex decomposition methods, including two new methods that handle polygons with holes—one is based on vertical decomposition and the other is based on triangulation.


  • Alon Baram, Efi FogelDan HalperinMichael Hemmer, and Sebastian Morr
    Exact Minkowski Sums of Polygons With Holes
    In Proceedings of the 23rd European Symposium on Algorithms (ESA), 2015 [link][bibtex]
    arXiv [pdf][bibtex]
  • Alon Baram
    Polygonal Minkowski Sums via Convolution: Theory and Practice
    M.Sc. Thesis, 2013 [pdf] [bibtex]


Alon Baram
Dan Halperin
Efi Fogel
Michael Hemmer
Sebastian Morr

Yair Oz - Webcreator


Skip to content