Abstract
The resemblance between the integer number system with multiplication and division and the system of convex objects with Minkowski addition and decomposition is really striking. The resemblance also indicates a computational technique which unifies the two Minkowski operations as a single operation. To view multiplication and division as a single operation, it became necessary to extend the integer number system to the rational number system. The unification of the two Minkowski operations also requires that the ordinary convex object domain must be appended by a notion of inverse objects or negative objects. More interestingly, the concept of negative objects permits further unification. A nonconvex object may be viewed as a mixture of ordinary convex object and negative object, and thereby, makes it possible to adopt exactly the same computational technique for convex as well as nonconvex objects. The unified technique, we show, can be easily understood and implemented if the input polygons and polyhedra are represented by their slope diagram representations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.K. Ghosh and S.P. Mudur, “The brush-trajectory approach to figure specification: Some algebraic solutions,” ACM Trans. on Graphics, Vol. 3, pp. 110–134, 1984.
P.K. Ghosh, “A mathematical model for shape description using Minkowski operators,” Comput. Vision Graphics Image Process., Vol. 44, pp. 239–269, 1988.
P.K. Ghosh, “A solution of polygon containment, spatial planning, and other related problems using Minkowski operations,” Comput. Vision Graphics Image Process., Vol. 49, pp. 1–35, 1990.
P.K. Ghosh, “An algebra of polygons through the notion of negative shapes,” CVGIP: Image Understanding, Vol. 54, No. 1, pp. 119–144, 1991.
P.K. Ghosh, “Vision, geometry, and Minkowski operators,” Contemporary Mathematics (Am. Math. Soc.), Vol. 119, pp. 63–83, 1991.
B. Grunbaum, Convex Polytopes, Interscience: London, 1967.
L.J. Guibas, L. Ramshaw, and J. Stolfi, “A kinetic framework for computational geometry,” Proc. of IEEE 24th Annual Symp. on Foundation of Computer Science, 1983, pp. 100–111.
L.J. Guibas and R. Seidel, “Computing convolutions by reciprocal search,” Discrete and Computational Geometry, Vol. 2, pp. 157–193, 1987.
K.P. Horn and J. Weldon, “Filtering closed curves,” IEEE Trans. on PAMI, Vol. PAMI-8, No. 5, pp. 665–668, 1986.
P.J. Kelly and M.L. Weiss, Geometry and Convexity, John Wiley & Sons: New York, 1979.
T. Lozano-Perez and M.A. Wesley, “An algorithm for planning collision-free paths among polyhedral obstacles,” Comm. of ACM, Vol. 22, pp. 560–570, 1979.
D. Mount and R. Silverman, “Combinatorial and computational aspects of Minkowski decompositions, contemporary mathematics,” Am. Math. Soc., Vol. 119, pp. 107–124, 1991.
F.P. Preparata and S.J. Hong, “Convex hull of finite sets of points in two and three dimensions,” Comm. ACM, Vol. 2, No. 20, pp. 87–93, 1977.
F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 1985.
A.A.G. Requicha and J.R. Rossignac, “Solid modeling and beyound,” IEEE Computer Graphics and Applications, Vol. 12, No. 5, pp. 31–44, 1992.
B.A. Rosenfeld and N.D. Sergeeva, Stereographic Projection, Mir Publisher: Moscow, 1977.
J.T. Schwartz, “Finding the minimum distance between two convex polygons,” Information Process. Lett., Vol. 13, pp. 168–170, 1981.
J. Serra, Image Analysis and Mathematical Morphology, Academic Press, 1982.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ghosh, P.K., Haralick, R.M. Mathematical morphological operations of boundary-represented geometric objects. J Math Imaging Vis 6, 199–222 (1996). https://doi.org/10.1007/BF00119839
Issue Date:
DOI: https://doi.org/10.1007/BF00119839