Skip to Main content Skip to Navigation
Conference papers

A new algorithm for the computation of the Minkowski difference of convex polyhedra

Hichem Barki 1 Florence Denis 1 Florent Dupont 1
1 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : We present a new algorithm, based on the concept of contributing vertices, for the exact and efficient computation of the Minkowski difference of convex polyhedra. First, we extend the concept of contributing vertices for the Minkowski difference case. Then, we generate a Minkowski difference facets superset by exploiting the information provided by the computed contributing vertices. Finally, we compute the Minkowski difference polyhedron through the trimming of the generated superset. We compared our Contributing Vertices-based Minkowski Difference (CVMD) algorithm to a Nef polyhedra-based approach using Minkowski addition, complement, transposition, and union operations. The performance benchmark shows that our CVMD algorithm outperforms the indirect Nef polyhedra-based approach. All our implementations use exact number types, produce exact results, and are based on CGAL, the Computational Geometry Algorithms Library.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01381570
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Friday, October 14, 2016 - 2:49:10 PM
Last modification on : Thursday, November 21, 2019 - 2:35:44 AM

Identifiers

Citation

Hichem Barki, Florence Denis, Florent Dupont. A new algorithm for the computation of the Minkowski difference of convex polyhedra. IEEE International Conference on Shape Modeling and Applications (SMI'10), Jun 2010, Aix-en-Provence, France. pp.206-210, ⟨10.1109/SMI.2010.12⟩. ⟨hal-01381570⟩

Share

Metrics

Record views

168