Computing the convolution and the Minkowski sum of surfaces
Proceedings of the 21st spring conference on Computer graphics
Rational surfaces with linear normals and their convolutions with rational surfaces
Computer Aided Geometric Design
Accurate Minkowski sum approximation of polyhedral models
Graphical Models - Special issue on PG2004
Minkowski sum boundary surfaces of 3D-objects
Graphical Models
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
Computer-Aided Design
Rational surfaces with linear normals and their convolutions with rational surfaces
Computer Aided Geometric Design
Oriented bounding surfaces with at most six common normals
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A GPU-based voxelization approach to 3D Minkowski sum computation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
A novel algorithm for extracting the boundaries of two planar curves' morphologic summation
Edutainment'06 Proceedings of the First international conference on Technologies for E-Learning and Digital Entertainment
Voxelized Minkowski sum computation on the GPU with robust culling
Computer-Aided Design
A sweep and translate algorithm for computing voxelized 3D Minkowski sums on the GPU
Computer-Aided Design
| Hi-index | 0.00 |
We present an algorithm for computing Minkowski sums among surfaces of revolution and surfaces of linear extrusion, generated by slope-monotone closed curves. The special structure of these simple surfaces allows the process of normal matching between two surfaces to be expressed as an explicit equation. Based on this insight, we also present an efficient algorithm for computing the distance between two simple surfaces, even though they may in general be non-convex. Using an experimental implementation, the distance between two surfaces of revolution was computed in less than 0.5 msec on average.