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
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Mapping Graphs on the Sphere to the Finite Plane
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Invertible Minkowski Sum of Polygons
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Erosion based visibility preprocessing
EGRW '03 Proceedings of the 14th Eurographics workshop on Rendering
Hyperpolygons generated by the invertible Minkowski sum of polygons
Pattern Recognition Letters - Special issue: Discrete geometry for computer imagery (DGCI'2002)
On the exact maximum complexity of Minkowski sums of convex polyhedra
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
Computer-Aided Design
Contributing vertices-based Minkowski sum computation of convex polyhedra
Computer-Aided Design
Contributing vertices-based Minkowski sum of a nonconvex--convex pair of polyhedra
ACM Transactions on Graphics (TOG)
Minkowski sum based octree generation for triangular meshes
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
| Hi-index | 0.00 |
A new method is presented to calculate the Minkowski sum of two convex polyhedra A and B in 3D. The method works as follows. The slope diagrams of A and B are considered as graphs. These graphs are given edge attributes. From these attributed graphs the attributed graph of the Minkowski sum is constructed. This graph is then transformed into the Minkowski sum of A and B. The running time of the algorithm is linear in the number of edges of the Minkowski sum.