Exact and efficient construction of Minkowski sums of convex polyhedra with applications

DOI10.1016/j.cad.2007.05.017zbMath1206.65082OpenAlexW1992584347MaRDI QIDQ628176

Efi Fogel, Dan Halperin

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

zbMATH Keywords

computational geometrycollision detectionGaussian map2D arrangement3D Minkowski sum

Mathematics Subject Classification ID

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)

Related Items

Exact Minkowski sums of polygons with holes, Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces, Arrangements on parametric surfaces. II: Concretizations and applications, The Minkowski sum of simplices in 3-dimensional space. An analytical description, Motion planning via manifold samples, Closed-form characterization of the Minkowski sum and difference of two ellipsoids, On the exact maximum complexity of Minkowski sums of polytopes

Uses Software

• CGAL