A new method is presented to calculate the Minkowski sum of two convex polyhedra A and B in 3D. 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.
|Uitgeverij||University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science|
|Status||Published - 2001|