Invertible Minkowski Sum of Polygons

  • Kokichi Sugihara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2301)


The paper gives a new formulation of the Minkowski sum of polygons. In the conventional Minkowski sum, the inverse operation is not well defined unless the polygons are restricted to be convex. In the proposed formulation, on the other hand, the set of polygons is extended to the set of “hyperpolygons” and the Minkowski sum forms a commutative group. Consequently, every polygon has its unique inverse, and the sum and the inverse operations can be taken freely. An example of a physical interpretation of the hyperpolygon is also given.


Line Segment Inverse Operation Radial Vector Polygonal Curve Material Shape 
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.


  1. 1.
    H. Bekker and J.B.T.M. Roerdink: An efficient algorithm to calculate the Minkowski sum of convex 3D polyhedra. Lecture Notes in Computer Science 2073, pp. 619–628, 2001.Google Scholar
  2. 2.
    N. Bourbaki: Éléments de Mathématique, Algébre 1. Hermann, Paris, 1964.Google Scholar
  3. 3.
    P. K. Ghosh: An algebra of polygons through the notion of negative shapes. CVGIP: Image Understanding, vol. 54 (1991), pp. 119–144.zbMATHCrossRefGoogle Scholar
  4. 4.
    P. K. Ghosh: Vision, geometry, and Minkowski operators. Contemporary Math., vol. 119 (1991), pp. 63–83.Google Scholar
  5. 5.
    P.K. Ghosh and R.M. Haralick: Mathematical morphological operations of boundary-represented geometric objects. J. Math. Imaging and Vision, vol. 6 (1996), pp. 199–222.CrossRefMathSciNetGoogle Scholar
  6. 6.
    L. J. Guibas, L. Ramshaw and J. Stolfi: A kinetic framework for computational geometry. Proc. 24th IEEE Symp. Foundation of Computer Sciences, (1983), pp. 100–111.Google Scholar
  7. 7.
    S. Har-Peled, T. M. Chan, B. Aronov, D. Halperin and J. Snoeyink: The complexity of a single face of a Minkowski sum. Proc. 7th Canadian Conf. Comput. Geom., (1995), pp. 91–96.Google Scholar
  8. 8.
    A. Hermandez-Barrera: Computing the Minkowski sum of monotone polygons. IEICE Transactions on Information and Systems, vol. E80-D (1997) pp. 218–222.Google Scholar
  9. 9.
    M.-S. Kim and K. Sugihara: Minkowski sums of axis-parallel surfaces of revolution defined by slope-monotone closed curves. IEICE Transactions on Information and Systems, vol. E84-D (2001), pp. 1540–1547.Google Scholar
  10. 10.
    D. Leven and M. Sharir: Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagram. Discrete and Comput. Geom., vol. 2 (1987), pp. 9–31.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    J. Mikusinski: Operational Calculus. Pergamon Press, London, 1957.Google Scholar
  12. 12.
    D. Mount and R. Silverman: Combinatorial and computational aspects of Minkowski decompositions. Contemporary Math., vol. 119 (1991), pp. 107–124.MathSciNetGoogle Scholar
  13. 13.
    G. D. Ramkumar: An algorithm to compute the Minkowski sum outer-face of two simple polygons. Proc. 12th ACM Symp. Comput. Geom., (1996), pp. 234–241.Google Scholar
  14. 14.
    K. Sugihara, T. Imai and T. Hataguchi: An algebra for slope-monotone closed curves. Int. J. Shape Modeling, vol. 3 (1997), pp. 167–183.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Kokichi Sugihara
    • 1
  1. 1.Department of Mathematical InformaticsUniversity of TokyoBunkyo-ku, TokyoJapan

Personalised recommendations