Personal tools
Laboratoire d'InfoRmatique en Image et Systèmes d'information

Skip to content. | Skip to navigation

Laboratoire d'InfoRmatique en Image et Systèmes d'information
UMR 5205 CNRS / INSA Lyon / Université Claude Bernard Lyon 1 / Université Lumière Lyon 2 / École Centrale de Lyon
You are here: Home > publis

International journal with reviewing committee

Contributing Vertices-Based Minkowski Sum of a Non-Convex--Convex Pair of Polyhedra
Hichem Barki [LIRIS] , Florence Denis [LIRIS] , Florent Dupont [LIRIS]
1/2011
ACM Transactions on Graphics (TOG) - Presented at SIGGRAPH 2011 30(1) pp. 3:1-3:16, ISSN 0730-0301.

HAL : hal-01354865

Abstract

The exact Minkowski sum of polyhedra is of particular interest in many applications, ranging from image analysis and processing to computer-aided design and robotics. Its computation and implementation is a difficult and complicated task when non-convex polyhedra are involved. We present the NCC-CVMS algorithm, an exact and efficient Contributing Vertices-based Minkowski Sum algorithm for the computation of the Minkowski sum of a Non-Convex--Convex pair of polyhedra, which handles non-manifold situations and extracts eventual polyhedral holes inside the Minkowski sum outer boundary. Our algorithm does not output boundaries that degenerate into a polyline or a single point. First, we generate a superset of the Minkowski sum facets through the use of the contributing vertices concept and by summing only the features (facets, edges, and vertices) of the input polyhedra which have coincident orientations. Secondly, we compute the 2D arrangements induced by the superset triangles’ intersections. Finally, we obtain the Minkowski sum through the use of two simple properties of the input polyhedra and the Minkowski sum polyhedron itself, i.e. the closeness and the two-manifoldness properties. The NCC-CVMS algorithm is efficient because of the simplifications induced by the use of the contributing vertices concept, the use of 2D arrangements instead of 3D arrangements which are difficult to maintain, and the use of simple properties to recover the Minkowski sum mesh. We implemented our NCC-CVMS algorithm on the base of CGAL and used exact number types. More examples and results of the NCC-CVMS algorithm can be found at: \url{http://liris.cnrs.fr/hichem.barki/mksum/NCC-CVMS}

Additional information

Presented at SIGGRAPH 2011

BibTex

Download

@Article{Liris-4866,
  title         = {{Contributing Vertices-Based Minkowski Sum of a 
    Non-Convex--Convex Pair of Polyhedra}},
  author        = {Hichem {Barki} and Florence {Denis} and Florent {Dupont}},
  year          = {2011},
  month         = jan,
  journal       = {ACM Transactions on Graphics (TOG) - Presented at SIGGRAPH 
    2011},
  volume        = {30}, 
  number        = {1}, 
  pages         = {3:1-3:16}, 
  DOI           = {10.1145/1899404.1899407}, 
  issn          = {0730-0301}, 
  language      = {en},
  url           = {http://liris.cnrs.fr/publis/?id=4866},
  note          = {Presented at SIGGRAPH 2011}
}