Exact minkowski sums of convex polyhedra

摘要

We present an exact imp ementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R³. Our implementation is complete in the sense that it does not assume general position, namely, it can handle degenerate input, and produces exact results. Our software also includes applications of the Minkowski-sum computation to answer collision and proximity queries about the relative placement of two convex polyhedra in R³. The algorithms use a dual representation of convex polyhedra,and their implementation is mainly based on the Arrangement package of Cgal the Computational Geometry Algorithm Library. We compare our Minkowski-sum construction with a naive approach that computes the convex hull of the pairwise sums of vertices of two convex polyhedra.Our method is significantly faster. The video demonstrates the techniques used on simple cases as well as on degenerate cases. The relevant programs, source code, data sets, and documentation are available at http://www.cs.tau.ac.il/~efif/CD Inparticular this site contains a detailed report [3 ]on our algorithms and their implementation including the experimental comparison with the convex-hull approach.