Improvements to algorithms for computing the Minkowski sum of 3-polytopes

DOI10.1016/S0010-4485(03)00023-XMaRDI QIDQ628098zbMATH OpenFDO

Authors Jami J. Shah, Joseph K. Davidson, Yan Yan Wu

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/S0010-4485(03)00023-X

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computer-aided design (modeling of curves and surfaces) (65D17) Computer science aspects of computer-aided design (68U07)

Recommendations

• scientific article; zbMATH DE number 1728309
• Contributing vertices-based Minkowski sum computation of convex polyhedra
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• Two approximate Minkowski sum algorithms

Cited in

(8)

• Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves
• scientific article; zbMATH DE number 1728309 (Why is no real title available?)
• Implementation and parallelization of a reverse-search algorithm for Minkowski sums
• Some indecomposable polyhedra
• Contributing vertices-based Minkowski sum computation of convex polyhedra
• Tolerance-based geometry constraint update scheme for high-precision direct modeling
• Gradient-parameterized deformable Minkowski sum with applications on contact detection
• Covering Minkowski sum boundary using points with applications

Describes a project that uses

Uses Software

• Qhull

This page was built for publication: Improvements to algorithms for computing the Minkowski sum of 3-polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628098)