Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method

@inproceedings{Wein2006ExactAE,
  title={Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method},
  author={Ron Wein},
  booktitle={ESA},
  year={2006}
}
The Minkowski sum of two sets A,B ∈ Rd, denoted A ⊕ B, is defined as {a+b|a ∈ A,b ∈ B}. We describe an efficient and robust implementation for the construction of Minkowski sums of polygons in R2 using the convolution of the polygon boundaries. This method allows for faster computation of the sum of non-convex polygons in comparison with the widely-used methods for Minkowski-sum computation that decompose the input polygons into convex sub-polygons and compute the union of the pairwise sums of… CONTINUE READING
BETA

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 38 CITATIONS

Fast and robust 2D Minkowski sum using reduced convolution

  • 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems
  • 2011
VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Fast and robust generation of city-scale seamless 3D urban models

  • Computer-Aided Design
  • 2011
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A New Method for Mapping the Configuration Space Obstacles of Polygons

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Dynamic Minkowski sums under scaling

  • Computer-Aided Design
  • 2013
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Extracting the Minkowski Sum Boundary from the Reduced Convolution ∗

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Exact and approximate construction of offset polygons

  • Computer-Aided Design
  • 2007
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Similar Papers