We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in \(\mathbb{R}^3\). Our implementation is complete in the sense that it does not assume general position, namely, it can handle degenerate input, and produces exact results. We also present applications of the Minkowski-sum computation to answer collision and proximity queries about the relative placement of two convex polyhedra in \(\mathbb{R}^3\). 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; in some cases it is fifty times faster than the convex-hull approach. The results of experimentation with a broad family of convex polyhedra are reported. The relevant programs, source code, data sets, and documentation are available at collision_detection
Minkowski sum of 2 orthogonal dioctagonal pyramids
|
|
|
|
