Computing convolutions by reciprocal search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Minkowski addition of polytopes: computational complexity and applications to Gro¨bner bases
SIAM Journal on Discrete Mathematics
Overlaying simply connected planar subdivisions in linear time
Proceedings of the eleventh annual symposium on Computational geometry
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Minkowski operations for satellite antenna layout
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
V-Clip: fast and robust polyhedral collision detection
ACM Transactions on Graphics (TOG)
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Polynomial/rational approximation of Minkowski sum boundary curves
Graphical Models and Image Processing
H-Walk: hierarchical distance computation for moving convex bodies
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Using generic programming for designing a data structure for polyhedral surfaces
Computational Geometry: Theory and Applications - Special issue on applications and challenges
Robot Motion Planning
Polygon decomposition for efficient construction of Minkowski sums
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
The Minkowski Sum of Two Simple Surfaces Generated by Slope-Monotone Closed Curves
GMP '02 Proceedings of the Geometric Modeling and Processing — Theory and Applications (GMP'02)
Accurate Minkowski Sum Approximation of Polyhedral Models
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
Exact minkowski sums of convex polyhedra
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On the exact maximum complexity of Minkowski sums of convex polyhedra
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Computing exact rational offsets of quadratic triangular Bézier surface patches
Computer-Aided Design
Optimal Accurate Minkowski Sum Approximation of Polyhedral Models
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Contributing vertices-based Minkowski sum computation of convex polyhedra
Computer-Aided Design
Discrete critical values: a general framework for silhouettes computation
SGP '09 Proceedings of the Symposium on Geometry Processing
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
A GPU-based voxelization approach to 3D Minkowski sum computation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Contributing vertices-based Minkowski sum of a nonconvex--convex pair of polyhedra
ACM Transactions on Graphics (TOG)
Motion planning via manifold samples
ESA'11 Proceedings of the 19th European conference on Algorithms
Algorithm to calculate the Minkowski sums of 3-polytopes based on normal fans
Computer-Aided Design
Controlled linear perturbation
Computer-Aided Design
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
Computer-Aided Design
Voxelized Minkowski sum computation on the GPU with robust culling
Computer-Aided Design
State estimation for Markovian Jump Linear Systems with bounded disturbances
Automatica (Journal of IFAC)
A sweep and translate algorithm for computing voxelized 3D Minkowski sums on the GPU
Computer-Aided Design
Methods of expert estimations concordance for integral quality estimation
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R^3. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it 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 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 the only three other methods that produce exact results we are aware of. One is a simple approach that computes the convex hull of the pairwise sums of vertices of two convex polyhedra. The second is based on Nef polyhedra embedded on the sphere, and the third is an output-sensitive approach based on linear programming. Our method is significantly faster. 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 http://www.cs.tau.ac.il/~efif/CD and a short movie [Fogel E, Halperin D. Video: Exact Minkowski sums of convex polyhedra. In: Proceedings of 21st annual ACM symposium on computational geometry. 2005. p. 382-3] that describes some of the concepts portrayed in this paper can be downloaded from http://www.cs.tau.ac.il/~efif/CD/Mink3d.avi.