Elsevier

Computers & Graphics

Volume 17, Issue 4, July–August 1993, Pages 357-378
Computers & Graphics

Computer graphics in India
A unified computational framework for Minkowski operations

https://doi.org/10.1016/0097-8493(93)90023-3Get rights and content

Abstract

In this paper we present a complete computational theory of Minkowski addition and Minkowski decomposition of boundary-represented objects. The theory can be summarized as a unified algorithm to compute Minkowski operations of 2D and 3D continuous objects. We unify the two Minkowski operations as a single operation by introducing the notion of negative shape; in contrast to that, the shapes of ordinary objects may be considered positive. More interestingly, the concept of negative shape makes possible further unification since exactly the same computational technique works for convex as well as nonconvex objects. This happens because conceptually a convex object can be viewed as a pure object—either completely positive or completely negative, while a nonconvex object is like a mixture of positive and negative ones. To make the unified algorithm conceptually simpler and computationally more efficient, we devise a new representation scheme, called the slope diagram representation, to represent the input polygons and polyhedra. The slope diagram representation also allows us to provide a nice geometric interpretation of negative shape. Finally, we take up various special cases to show how the unified algorithm can be quickly simplified when the input objects are endowed with more structure (such as, the objects are all convex, or, the boundaries of the objects can be expressed as smooth analytic functions, etc.).

References (26)

  • L.J. Guibas et al.

    A kinetic framework for computational geometry

  • L.J. Guibas et al.

    Computing convolutions by reciprocal search

    Discrete Comp. Geom.

    (1987)
  • R.M. Haralick et al.

    Image analysis using mathematical morphology

    IEEE Trans. PAMI

    (1987)
  • Cited by (99)

    • Closed-form Minkowski sums of convex bodies with smooth positively curved boundaries

      2022, CAD Computer Aided Design
      Citation Excerpt :

      Although the focus of this article is convex bodies, it is still possible to extend the capability of our work to deal with non-convex bodies using convex decomposition methods. A unified framework based on slope diagram has been presented for both convex and non-convex bodies in both 2D and 3D spaces [21]. The idea is closely related to the Gauss map, which maps a surface point into its normal vector.

    • Exact Minkowski sums of polygons with holes

      2018, Computational Geometry: Theory and Applications
      Citation Excerpt :

      They also tested different decomposition methods, but none of them handles polygons with holes. Ghosh [14] introduced slope diagrams—a data structure that was used later on by some of us to construct Minkowski sums of bounded convex polyhedra in 3D [15]. Hachenberger [8] constructed Minkowski sums of general polyhedra in 3D.

    View all citing articles on Scopus
    View full text