Skip to main content
Log in

Algorithms for Minkowski products and implicitly‐defined complex sets

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

Minkowski geometric algebra is concerned with the complex sets populated by the sums and products of all pairs of complex numbers selected from given complex‐set operands. Whereas Minkowski sums (under vector addition in Rn have been extensively studied, from both the theoretical and computational perspective, Minkowski products in R2 (induced by the multiplication of complex numbers) have remained relatively unexplored. The complex logarithm reveals a close relation between Minkowski sums and products, thereby allowing algorithms for the latter to be derived through natural adaptations of those for the former. A novel concept, the logarithmic Gauss maps of plane curves, plays a key role in this process, furnishing geometrical insights that parallel those associated with the “ordinary” Gauss map. As a natural generalization of Minkowski sums and products, the computation of “implicitly‐defined” complex sets (populated by general functions of values drawn from given sets) is also considered. By interpreting them as one‐parameter families of curves, whose envelopes contain the set boundaries, algorithms for evaluating such sets are sketched.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.W. Bruce and P.J. Giblin, Curves and Singularities, 2nd ed. (Cambridge Univ. Press, Cambridge, 1992).

    Google Scholar 

  2. R. Deaux, Introduction to the Geometry of Complex Numbers (translated from the French by H. Eves) (F. Ungar, New York, 1956).

    Google Scholar 

  3. M.P. do Carmo, Differential Geometry of Curves and Surfaces (Prentice-Hall, Englewood Cliffs, NJ, 1976).

    Google Scholar 

  4. G. Farin, Curves and Surfaces for CAGD, 3rd ed. (Academic Press, Boston, 1993).

    Google Scholar 

  5. R.T. Farouki and T.N.T. Goodman, On the optimal stability of the Bernstein basis, Math. Comp. 65 (1996) 1553–1566.

    Article  MATH  MathSciNet  Google Scholar 

  6. R.T. Farouki, H.P. Moon and B. Ravani, Minkowski geometric algebra of complex sets, Geom. Dedicata (2000) to appear.

  7. R.T. Farouki and C.A. Neff, Analytic properties of plane offset curves & Algebraic properties of plane offset curves, Comput. Aided Geom. Design 7(1990) 83–99 & 101?127.

    Article  MATH  MathSciNet  Google Scholar 

  8. R.T. Farouki and C.A. Neff, Hermite interpolation by Pythagorean-hodograph quintics, Math. Comp. 64 (1995) 1589–1609.

    Article  MATH  MathSciNet  Google Scholar 

  9. R.T. Farouki and V.T. Rajan, On the numerical condition of polynomials in Bernstein form, Comput. Aided Geom. Design 4(1987) 191–216.

    Article  MATH  MathSciNet  Google Scholar 

  10. P.K. Ghosh, A mathematical model for shape description using Minkowski operators, Comput. Vision Graphics Image Process. 44 (1988) 239–269.

    Article  Google Scholar 

  11. H. Hadwiger, Vorlesungen über Inhalt, Oberfläche, und Isoperimetrie (Springer, Berlin, 1957).

    Google Scholar 

  12. A. Kaul, Computing Minkowski sums, Ph.D. thesis, Columbia University (1993).

  13. A. Kaul and R.T. Farouki, Computing Minkowski sums of plane curves, Internat. J. Comput. Geom. Appl. 5 (1995) 413–432.

    Article  MATH  MathSciNet  Google Scholar 

  14. J.M. Lane and R.F. Riesenfeld, Bounds on a polynomial, BIT 21(1981) 112–117.

    Article  MATH  MathSciNet  Google Scholar 

  15. J.D. Lawrence, A Catalog of Special Plane Curves (Dover, New York, 1972).

    Google Scholar 

  16. I.K. Lee and M.S. Kim, Polynomial/rational approximation of Minkowski sum boundary curves, Graphical Models Image Process. 60 (1998) 136–165.

    Article  Google Scholar 

  17. I.K. Lee, M.S. Kim, and G. Elber, New approximation methods of planar offset and convolution curves, in: Geometric Modeling: Theory and Practice, eds. W. Strasser, R. Klein and R. Rau (Springer, Berlin, 1997) pp. 83–101.

    Google Scholar 

  18. E.H. Lockwood, A Book of Curves (Cambridge Univ. Press, Cambridge, 1967).

    Google Scholar 

  19. H. Minkowski, Volumen und Oberfläche, Math. Ann. 57 (1903) 447–495.

    Article  MATH  MathSciNet  Google Scholar 

  20. R.E. Moore, Interval Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1966).

    Google Scholar 

  21. R.E. Moore, Methods and Applications of Interval Analysis (SIAM, Philadelphia, PA, 1979).

    Google Scholar 

  22. T. Needham, Visual Complex Analysis (Oxford Univ. Press, Oxford, 1997).

    Google Scholar 

  23. R. Schneider, Convex Bodies: The Brunn-Minkowski Theory (Cambridge Univ. Press, Cambridge, 1993).

    Google Scholar 

  24. H. Schwerdtfeger, Geometry of Complex Numbers (Dover, New York, 1979).

    Google Scholar 

  25. T.W. Sederberg and S.R. Parry, Comparison of three curve intersection algorithms, Comput. Aided Design 18 (1986) 58–64.

    Article  Google Scholar 

  26. J. Serra, Image Analysis and Mathematical Morphology (Academic Press, London, 1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Farouki, R.T., Moon, H.P. & Ravani, B. Algorithms for Minkowski products and implicitly‐defined complex sets. Advances in Computational Mathematics 13, 199–229 (2000). https://doi.org/10.1023/A:1018910412112

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018910412112

Navigation