Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
From MaRDI portal
Publication:5449585
DOI10.1007/11841036_73zbMath1131.52300OpenAlexW1604565389MaRDI QIDQ5449585
Publication date: 11 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11841036_73
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mixed volumes and related topics in convex geometry (52A39)
Related Items (9)
Exact Minkowski sums of polygons with holes ⋮ A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes ⋮ Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces ⋮ Algorithms for computing Minkowski operators and their application in differential games ⋮ Variable Moving Average Transform Stitching Waves ⋮ A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes ⋮ Motion planning via manifold samples ⋮ Properties of the \(d\)-dimensional Earth mover's problem ⋮ A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
Uses Software
This page was built for publication: Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
