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

DOI10.1016/J.CAD.2007.05.017MaRDI QIDQ628176zbMATH OpenOpenAlexFDO

Authors 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 detection2D arrangement3D Minkowski sumGaussian map

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)

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

Cited in

(26)

• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
• Contributing vertices-based Minkowski sum computation of convex polyhedra
• Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
• Minkowski plasticity in 3D frames: decoupled construction of the cross-section yield surface and efficient stress update strategy
• 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
• Implementation and parallelization of a reverse-search algorithm for Minkowski sums
• Approximate convex intersection detection with applications to width and Minkowski sums
• 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
• The linear inequalities set representation of Minkovski's sum for two polyhedrons
• Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
• Minkowski sums of rotating convex polyhedra
• A unified algebraic framework for fast and precise planar swept volumes and Minkowski sums
• A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
• scientific article; zbMATH DE number 1728309 (Why is no real title available?)
• On the exact maximum complexity of Minkowski sums of polytopes
• Arrangements on parametric surfaces. II: Concretizations and applications
• Improvements to algorithms for computing the Minkowski sum of 3-polytopes
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• 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
• Local polyhedra and geometric graphs
• Closed-form characterization of the Minkowski sum and difference of two ellipsoids
• From the zonotope construction to the Minkowski addition of convex polytopes

Describes a project that uses

Uses Software

• CGAL

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)