论文信息 - An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra

An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra

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.

Jos B. T. M. Roerdink | Henk Bekker | J. Roerdink | H. Bekker

[1] Pijush K. Ghosh,et al. A unified computational framework for Minkowski operations , 1993, Comput. Graph..

[2] H. G. Eggleston. Convexity by H. G. Eggleston , 1958 .

[3] Ulrich Finke,et al. Overlaying simply connected planar subdivisions in linear time , 1995, SCG '95.

[4] Leonidas J. Guibas,et al. Computing convolutions by reciprocal search , 1986, SCG '86.

[5] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[6] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[7] Jos B. T. M. Roerdink,et al. Calculating critical orientations of polyhedra for similarity measure evaluation , 1999 .

[8] Henk J. A. M. Heijmans,et al. Similarity measures for convex polyhedra based on Minkowski addition , 2000, Pattern Recognit..