scispace - formally typeset
Search or ask a question

Showing papers on "Minkowski addition published in 1990"


Journal ArticleDOI
Christian Ronse1
TL;DR: It is shown that it is also necessary for a mathematically coherent application of morphological operators to grey-level images, and dilations and erosions can be defined directly with lattice-theoretic methods, without recourse to umbras.

218 citations


Patent
12 May 1990
TL;DR: In this paper, the Minkowski sum of two polyhedra is computed as the union of linear translational sweeps enabled by a generalization of sweeping a face along an edge.
Abstract: A method for constructing the Minkowski sum and derivative morphological combinations of arbitrary polyhedra uses operations supported in current CAD/CAM systems. The method has application to three-dimensional modeling of very large scale integrated (VLSI) circuits, their design and simulation of fabrication, and to automated mechanical assembly. The method also has application to n-dimensional modeling in robotics as well as other applications of CAD/CAM systems. In one aspect, an exact Minkowski sum of two polyhedra is obtained by a generalization of sweeping a face along an edge. More generally, according to a second aspect, the Minkowski sum of two polyhedra is computed as the union of linear translational sweeps enabled by the first aspect. The method implements techniques and formulas which greatly reduces the overall cost of the computation of Minkowski sums and, in particular, avoids computations involving non-transversal polyhedra. In a third aspect, the method reduces the difficulty of computing the Minkowski sum of a convex polyhedron and a general polyhedron by using simpler surrogate sets for the convex polyhedron.

29 citations