Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Literature
H. Bekker, J. B. T. M. Roerdink: Calculating critical orientations of polyhedra for similarity measure evaluation. Proc. of the IASTED Int. Conf. Computer Graphics and Imaging, 1999, Palm Springs, USA. p. 106–111
A. V. Tuzikov, J. B. T. M. Roerdink, H. J. A. M. Heijmans: Similarity Measures for Convex Polyhedra Based on Minkowski Addition. Pattern Recognition 33 (2000) 979–995
L. J. Guibas, R. Seidel: Computing convolutions by reciprocal search. Discrete and Computational Geometry. Vol. 2, p. 175–193, 1987.
M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf: Computational Geometry, Algorithms and Applications. Springer Verlag, Berlin. (1997)
P. K. Ghosh: A unified computational framework for Minkowski operations. Comput. & Graphics, Vol. 17, No. 4, 1993.
U. Finke, K. H. Hinrichs: Overlaying simply connected planar subdivisions in linear time. Proc. of the 11th Int. symposium on computational geometry, 1995.
A. M. Brinkmann: Entwicklung und robuste Implementierung eines laufzeitoptimalen Verschneidungsoperators für Trapezoidzerlegungen von thematishen Karten. PhD. Thesis, University of Münster, 1998.
K. Melhorn, S. Näher: LEDA A Platform for Combinatorial and Geometric Computing. Cambridge University press, Cambridge. 1999
H. G. Eggleston: Convexity. Cambridge University Press, Cambridge. 1958
H. Busemann: Convex Surfaces. Interscience, Inc., New York. 1958
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bekker, H., Roerdink, J.B.T.M. (2001). An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_71
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive