Contributing vertices-based Minkowski sum computation of convex polyhedra - Archive ouverte HAL Access content directly
Journal Articles Computer-Aided Design Year : 2009

Contributing vertices-based Minkowski sum computation of convex polyhedra


Minkowski sum is an important operation. It is used in many domains such as: computer-aided design, robotics, spatial planning, mathematical morphology, and image processing. We propose a novel algorithm, named the Contributing Vertices-based Minkowski Sum (CVMS) algorithm for the computation of the Minkowski sum of convex polyhedra. The CVMS algorithm allows to easily obtain all the facets of the Minkowski sum polyhedron only by examining the contributing vertices-a concept we introduce in this work, for each input facet. We exploit the concept of contributing vertices to propose the Enhanced and Simplified Slope Diagram-based Minkowski Sum (ESSDMS) algorithm, a slope diagram-based Minkowski sum algorithm sharing some common points with the approach proposed by Wu et al. [1]. The ESSDMS algorithm does not embed input polyhedra on the unit sphere and does not need to perform stereographic projections. Moreover, the use of contributing vertices brings up more simplifications and improves the overall performance. The implementations for the mentioned algorithms are straightforward, use exact number types, produce exact results, and are based on CGAL, the Computational Geometry Algorithms Library. More examples and results of the CVMS algorithm for several convex polyhedra can be found at
Fichier principal
Vignette du fichier
Liris-3813.pdf (1.51 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01437644 , version 1 (06-03-2017)



Hichem Barki, Florence Denis, Florent Dupont. Contributing vertices-based Minkowski sum computation of convex polyhedra. Computer-Aided Design, 2009, 7, 41, pp.525-538. ⟨10.1016/j.cad.2009.03.008⟩. ⟨hal-01437644⟩
182 View
736 Download



Gmail Facebook Twitter LinkedIn More