Abstract
Minkowski geometric algebra is concerned with sets in the complex plane that are generated by algebraic combinations of complex values varying independently over given sets in ℂ. This algebra provides an extension of real interval arithmetic to sets of complex numbers, and has applications in computer graphics and image analysis, geometrical optics, and dynamical stability analysis. Algorithms to compute the boundaries of Minkowski sets usually invoke redundant segmentations of the operand-set boundaries, guided by a “matching” criterion. This generates a superset of the true Minkowski set boundary, which must be extracted by the laborious process of identifying and culling interior edges, and properly organizing the remaining edges. We propose a new approach, whereby the matching condition is regarded as an implicit curve in the space ℝn whose coordinates are boundary parameters for the n given sets. Analysis of the topological configuration of this curve facilitates the identification of sets of segments on the operand boundaries that generate boundary segments of the Minkowski set, and rejection of certain sets that satisfy the matching criterion but yield only interior edges. Geometrical relations between the operand set boundaries and the implicit curve in ℝn are derived, and the use of the method in the context of Minkowski sums, products, planar swept volumes, and Horner terms is described.
Similar content being viewed by others
References
S. Arnborg and H. Feng, Algebraic decomposition of regular curves, J. Symbolic Comput. 5 (1988) 131–140.
D.S. Arnon, Topologically reliable display of algebraic curves, ACM Computer Graphics 17 (1983) 219–227.
D.S. Arnon, G.E. Collins and S. McCallum, Cylindrical algebraic decomposition I: The basic algorithm, SIAM J. Computing 13 (1984) 865–877.
D.S. Arnon, G.E. Collins and S. McCallum, Cylindrical algebraic decomposition II: An adjacency algorithm for the plane, SIAM J. Computing 13 (1984) 878–889.
D.S. Arnon and S. McCallum A polynomial-time algorithm for the topological type of a real algebraic curve, J. Symbolic Comput. 5 (1988) 213–236.
P. Cellini, P. Gianni and C. Traverso, Algorithms for the shape of semialgebraic sets: A new approach, in: Lecture Notes in Computer Science, Vol. 539 (Springer, New York, 1991) pp. 1–18.
R.T. Farouki and J.-C.A. Chastang, Curves and surfaces in geometrical optics, in: Mathematical Methods in Computer Aided Geometric Design II, eds. T. Lyche and L.L. Schumaker (Academic Press, New York, 1992) pp. 239–260.
R.T. Farouki and J.-C.A. Chastang, Exact equations of “simple” wavefronts, Optik 91 (1992) 109–121.
R.T. Farouki, W. Gu and H.P. Moon, Minkowski roots of complex sets, in: Geometric Modeling and Processing 2000 (IEEE Computer Soc. Press, Los Alamitos, CA, 2000) pp. 287–300.
R.T. Farouki and C.Y. Han, Computation of Minkowski values of polynomials over complex sets, Numer. Algorithms 36 (2004) 13–29.
R.T. Farouki and C.Y. Han, Solution of elementary equations in the Minkowski geometric algebra of complex sets, Adv. Comput. Math. 22 (2005) 301–323.
R.T. Farouki and C.Y. Han, Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems, Preprint (2005).
R.T. Farouki, C.Y. Han, J. Hass and T.W. Sederberg, Topologically consistent trimmed surface approximations based on triangular patches, Computer Aided Geom. Design 21 (2004) 459–478.
R.T. Farouki and H.P. Moon, Minkowski geometric algebra and the stability of characteristic polynomials, in: Visualization in Mathematics, Vol. 3, eds. H.-C. Hege and K. Polthier (Springer, Berlin, 2003) pp. 163–188.
R.T. Farouki, H.P. Moon and B. Ravani, Algorithms for Minkowski products and implicitly-defined complex sets, Adv. Comput. Math. 13 (2000) 199–229.
R.T. Farouki, H.P. Moon and B. Ravani, Minkowski geometric algebra of complex sets, Geometriae Dedicata 85 (2001) 283–315.
R.T. Farouki and H. Pottmann, Exact Minkowski products of N complex disks, Reliable Computing 8 (2002) 43–66.
P.K. Ghosh, A mathematical model for shape description using Minkowski operators, Computer Vision Graphics Image Processing 44 (1988) 239–269.
L. Gonzalez-Vega and I. Necula, Efficient topology determination of implicitly defined algebraic plane curves, Computer Aided Geom. Design 19 (2002) 719–743.
T.A. Grandine and F.W. Klein, A new approach to the surface intersection problem, Computer Aided Geom. Design 14 (1997) 111–134.
H. Hadwiger, Vorlesungen über Inhalt, Oberfläche, und Isoperimetrie (Springer, Berlin, 1957).
J. Hass, R.T. Farouki, C.Y. Han, X. Song and T.W. Sederberg, Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme, Adv. Comput. Math. (2005), to appear.
H. Hong, An efficient method for analyzing the topology of plane real algebraic curves, Math. Comput. Simulation 42 (1996) 571–582.
A. Kaul, Computing Minkowski sums, Ph.D. thesis, Columbia University (1993).
A. Kaul and R.T. Farouki, Computing Minkowski sums of plane curves, Internat. J. Comput. Geometry Appl. 5 (1995) 413–432.
A. Kaul and J.R. Rossignac, Solid interpolating deformations: Construction and animation of PIP, Comput. Graphics 16 (1992) 107–115.
T. Lozano-Pérez and M.A. Wesley, An algorithm for planning collision-free paths among polyhedral obstacles, Commun. ACM 22 (1979) 560–570.
G. Matheron, Random Sets and Integral Geometry (Wiley, New York, 1975).
A.E. Middleditch, Applications of a vector sum operator, Computer Aided Design 20 (1988) 183–188.
H. Minkowski, Volumen und Oberfläche, Math. Annalen 57 (1903) 447–495.
R.E. Moore, Interval Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1966).
R.E. Moore, Methods and Applications of Interval Analysis (SIAM, Philadelphia, PA, 1979).
M.-F. Roy and A. Szpirglas, Complexity of the computation of cylindrical decomposition and topology of real algebraic curves using Thom's lemma, in: Lecture Notes in Mathematics, Vol. 1420 (Springer, New York, 1990) pp. 223–236.
T. Sakkalis, The topological configuration of a real algebraic curve, Bull. Austral. Math. Soc. 43 (1991) 37–50.
J. Serra, Image Analysis and Mathematical Morphology (Academic Press, London, 1982).
J. Serra, Introduction to mathematical morphology, Computer Vision Graphics Image Processing 35 (1986) 283–305.
X.W. Song, T.W. Sederberg, J. Zheng, R.T. Farouki and J. Hass, Linear perturbation methods for topologically consistent representations of free-form surface intersections, Computer Aided Geom. Design 21 (2004) 303–319.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C. Brezinski
Rights and permissions
About this article
Cite this article
Farouki, R.T., Han, C.Y. & Hass, J. Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves. Numer Algor 40, 251–283 (2005). https://doi.org/10.1007/s11075-005-4565-9
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11075-005-4565-9