Output-size sensitive algorithms for constructive problems in computational geometry
Output-size sensitive algorithms for constructive problems in computational geometry
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
The Union of Convex Polyhedra in Three Dimensions
SIAM Journal on Computing
Strategies for polyhedral surface decomposition: an experimental study
Computational Geometry: Theory and Applications
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Polynomial/rational approximation of Minkowski sum boundary curves
Graphical Models and Image Processing
Computer Vision and Image Understanding
An Algorithm for Convex Polytopes
Journal of the ACM (JACM)
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Fast penetration depth estimation using rasterization hardware and hierarchical refinement
Proceedings of the nineteenth annual symposium on Computational geometry
Convex decompositions of polyhedra
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Topology preserving surface extraction using adaptive subdivision
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Accurate Minkowski sum approximation of polyhedral models
Graphical Models - Special issue on PG2004
Computational Geometry: Theory and Applications
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
Computer-Aided Design
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers
Point-Based Minkowski Sum Boundary
PG '07 Proceedings of the 15th Pacific Conference on Computer Graphics and Applications
A kinetic framework for computational geometry
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Contributing vertices-based Minkowski sum of a nonconvex--convex pair of polyhedra
ACM Transactions on Graphics (TOG)
Stabilization of polytopic delay difference inclusions via the Razumikhin approach
Automatica (Journal of IFAC)
Algorithm to calculate the Minkowski sums of 3-polytopes based on normal fans
Computer-Aided Design
Dynamic Minkowski sums under scaling
Computer-Aided Design
State estimation for Markovian Jump Linear Systems with bounded disturbances
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
Minkowski sum is an important operation. It is used in many domains such as: computer-aided design, robotics, spatial planning, mathematical morphology, and image processing. We propose a novel algorithm, named the Contributing Vertices-based Minkowski Sum (CVMS) algorithm for the computation of the Minkowski sum of convex polyhedra. The CVMS algorithm allows to easily obtain all the facets of the Minkowski sum polyhedron only by examining the contributing vertices-a concept we introduce in this work, for each input facet. We exploit the concept of contributing vertices to propose the Enhanced and Simplified Slope Diagram-based Minkowski Sum (ESSDMS) algorithm, a slope diagram-based Minkowski sum algorithm sharing some common points with the approach proposed by Wu et al. [Wu Y, Shah J, Davidson J. Improvements to algorithms for computing the Minkowski sum of 3-polytopes. Comput Aided Des. 2003; 35(13): 1181-92]. The ESSDMS algorithm does not embed input polyhedra on the unit sphere and does not need to perform stereographic projections. Moreover, the use of contributing vertices brings up more simplifications and improves the overall performance. The implementations for the mentioned algorithms are straightforward, use exact number types, produce exact results, and are based on CGAL, the Computational Geometry Algorithms Library. More examples and results of the CVMS algorithm for several convex polyhedra can be found at http://liris.cnrs.fr/hichem.barki/mksum/CVMS-convex.