Contributing vertices-based Minkowski sum computation of convex polyhedra

DOI10.1016/J.CAD.2009.03.008zbMATH Open1206.65070OpenAlexW2059284285MaRDI QIDQ628213FDOQ628213

Authors: Hichem Barki, Florence Denis, Florent Dupont 

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.2009.03.008

Recommendations

• scientific article; zbMATH DE number 1728309
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• 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
• Minkowski sum volume minimization for convex polyhedra
• Polygon decomposition for efficient construction of Minkowski sums
• scientific article; zbMATH DE number 1670643
• Improvements to algorithms for computing the Minkowski sum of 3-polytopes
• Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces

zbMATH Keywords

convex hullMinkowski sumcomputer-aided designcontributing verticesslope diagram

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)

Cited In (12)

• Operations between sets in geometry
• Implementation and parallelization of a reverse-search algorithm for Minkowski sums
• The linear inequalities set representation of Minkovski's sum for two polyhedrons
• Minkowski sums of rotating convex polyhedra
• Title not available (Why is that?)
• Exact and efficient construction of Minkowski sums of convex polyhedra with 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
• Stabilization of polytopic delay difference inclusions via the razumikhin approach
• Nucleation and growth of lattice crystals
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes

Uses Software

• CGAL
• Qhull

This page was built for publication: Contributing vertices-based Minkowski sum computation of convex polyhedra

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