Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
From MaRDI portal
Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
Recommendations
Cited in
(15)- Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
- Properties of the \(d\)-dimensional Earth mover's problem
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions
- scientific article; zbMATH DE number 1728309 (Why is no real title available?)
- Algorithms for computing Minkowski operators and their application in differential games
- Variable moving average transform stitching waves
- scientific article; zbMATH DE number 2087477 (Why is no real title available?)
- COMPUTING MINKOWSKI SUMS OF PLANE CURVES
- A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS
- Computing convolutions and Minkowski sums via support functions
- A measure of non-convexity in the plane and the Minkowski sum
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- 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
This page was built for publication: Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449585)
