Exact and efficient construction of Minkowski sums of convex polyhedra with applications
From MaRDI portal
Publication:628176
DOI10.1016/J.CAD.2007.05.017zbMATH Open1206.65082OpenAlexW1992584347MaRDI QIDQ628176FDOQ628176
Publication date: 4 March 2011
Published in: CAD. Computer-Aided Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cad.2007.05.017
Recommendations
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
- Contributing vertices-based Minkowski sum computation of convex polyhedra
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (18)
- Minkowski plasticity in 3D frames: decoupled construction of the cross-section yield surface and efficient stress update strategy
- Contributing vertices-based Minkowski sum computation of convex polyhedra
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
- Minkowski sum volume minimization for convex polyhedra
- Accurate Minkowski sum approximation of polyhedral models
- Motion planning via manifold samples
- The Minkowski sum of simplices in 3-dimensional space. An analytical description
- A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes
- Minkowski sums of rotating convex polyhedra
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- Title not available (Why is that?)
- On the exact maximum complexity of Minkowski sums of polytopes
- Arrangements on parametric surfaces. II: Concretizations and applications
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
- Exact Minkowski sums of polygons with holes
- Closed-form characterization of the Minkowski sum and difference of two ellipsoids
- From the zonotope construction to the Minkowski addition of convex polytopes
- Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
Uses Software
This page was built for publication: Exact and efficient construction of Minkowski sums of convex polyhedra with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628176)
