Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions

Journal of Computational and Applied Mathematics

Volumn 209, Issue 2, 2007, Pages 246-266

  Farouki, Rida T ^a   Hass, Joel ^b  

^a University of California   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Covering degree; Curvature; Gauss map; Geometrical convolutions; Minkowski sums; Planar graph; Singular points; Topological configuration

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; CONVOLUTION; GRAPH THEORY; OPTIMIZATION;

COVERING DEGREE; GAUSS MAP; GEOMETRICAL CONVOLUTIONS; MINKOWSKI SUMS; SINGULAR POINTS; TOPOLOGICAL CONFIGURATION;

COMPUTATIONAL METHODS;

EID: 34548428659     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2006.11.006     Document Type: Article

References (87)

1. Abdel-Malek K., and Yeh H.J. Geometric representation of the swept volume using Jacobian rank deficiency conditions. Comput. Aided Design 29 (1997) 457-468
2. Agarwal P.K., Flato E., and Halperin D. Polygon decomposition for efficient construction of Minkowski sums. Comput. Geometry-Theory Appl. 21 (2002) 39-61
3. Ahn J.W., Kim M.S., and Lim S.B. Approximate general sweep boundary of 2D object. CVGIP: Graph. Models and Image Process. 55 (1993) 98-128
4. Arnborg S., and Feng H. Algebraic decomposition of regular curves. J. Symbol. Comput. 5 (1988) 131-140
5. Arnon D.S. Topologically reliable display of algebraic curves. ACM Comput. Graphics 17 (1983) 219-227
6. Arnon D.S., Collins G.E., and McCallum S. Cylindrical algebraic decomposition I: The basic algorithm. SIAM J. Comput. 13 (1984) 865-877
7. Arnon D.S., Collins G.E., and McCallum S. Cylindrical algebraic decomposition II: An adjacency algorithm for the plane. SIAM J. Comput. 13 (1984) 878-889
8. Arnon D.S., and McCallum S. A polynomial-time algorithm for the topological type of a real algebraic curve. J. Symbol. Comput. 5 (1988) 213-236
9. Baek B., Shin S.Y., and Chwa K.Y. On computing translational swept volumes. Internat. J. Comput. Geometry Appl. 9 (1999) 293-317
10. Blackmore D., Leu M.C., and Shih F. Analysis and modeling of deformed swept volumes. Comput. Aided Design 26 (1994) 315-326
11. Blackmore D., Leu M.C., and Wang L.P. The sweep-envelope differential equation algorithm and its applications to NC machining verification. Comput. Aided Design 29 (1997) 629-637
12. Blackmore D., Leu M.C., Wang L.P., and Jiang H. Swept volumes: a retrospective and prospective view. Neural Parallel Sci. Comput. 5 (1997) 81-102
13. Blum H., and Nagel R.N. Shape description using weighted symmetric axis features. Pattern Recogn. 10 (1978) 167-180
14. Boltyanskii V.G. Envelopes (1964), Macmillan, New York
15. Bookstein F.L. The line-skeleton. Comput. Graphics Image Process. 11 (1979) 123-137
16. Bracewell R.N. The Fourier Transform and its Applications. third ed. (1999), McGraw-Hill, New York
17. Bruce J.W., and Giblin P.J. What is an envelope?. Math. Gazette 65 (1981) 186-192
18. Bruce J.W., and Giblin P.J. Curves and Singularities (1984), Cambridge University Press, Cambridge
19. Cameron S. Collision detection by four-dimensional intersection testing. IEEE Trans. Robot. Automat. 6 (1990) 291-302
20. Cellini P., Gianni P., and Traverso C. Algorithms for the shape of semialgebraic sets: a new approach. Lecture Notes in Computer Science vol. 539 (1991), Springer, Berlin 1-18
21. do Carmo M.P. Differential Geometry of Curves and Surfaces (1976), Prentice-Hall, Englewood Cliffs, NJ
22. Dorf R.C., and Bishop R.H. Modern Control Systems. 10th ed. (2005), Prentice-Hall, Upper Saddle River, NJ
23. Elber G., Lee I.-K., and Kim M.-S. Comparing offset curve approximation methods. IEEE Comput. Graphics Appl. 17 3 (1997) 62-71
24. Erdmann M.A. Protein similarity from knot theory and geometric convolutions. Proceedings of the Annual Conference on Research in Computational Molecular Biology. San Diego (2004) 195-204
25. Farouki R.T. The approximation of non-degenerate offset surfaces. Comput. Aided Geom. Design 3 (1986) 15-43
26. Farouki R.T. Pythagorean-hodograph curves. In: Farin G., Hoschek J., and Kim M.-S. (Eds). Handbook of Computer Aided Geometric Design (2002), Elsevier, Amsterdam 405-427
27. Farouki R.T. Minkowski combinations of complex sets-geometry algorithms, and applications. In: Lyche T., Mazure M.-L., and Schumaker L.L. (Eds). Curve and Surface Design: Saint-Malo 2002 (2003), Nashboro Press 123-146
28. Farouki R.T., and Chastang J.-C.A. Curves and surfaces in geometrical optics. In: Lyche T., and Schumaker L.L. (Eds). Mathematical Methods in Computer Aided Geometric Design II (1992), Academic Press, New York 239-260
29. Farouki R.T., and Chastang J.-C.A. Exact equations of "simple" wavefronts. Optik 91 (1992) 109-121
30. Farouki R.T., Gu W., and Moon H.P. Minkowski roots of complex sets. Geometric Modeling and Processing 2000 (2000), IEEE Computer Society Press 287-300
31. Farouki R.T., and Han C.Y. Computation of Minkowski values of polynomials over complex sets. Numer. Algorithms 36 (2004) 13-29
32. Farouki R.T., and Han C.Y. Solution of elementary in the Minkowski geometric algebra of complex sets. Adv. Comput. Math. 22 (2005) 325-352
33. R.T. Farouki, C.Y. Han, Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems, Appl. Algebra Eng. Comm. Comput., 2006, to appear.
34. Farouki R.T., Han C.Y., and Hass J. Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves. Numer. Algorithms 40 (2005) 251-283
35. Farouki R.T., and Hinds J.K. A hierarchy of geometric forms. IEEE Comput. Graphics Appl. 5 5 (1985) 51-78
36. Farouki R.T., and Moon H.P. Minkowski geometric algebra and the stability of characteristic polynomials. In: Hege H.-C., and Polthier K. (Eds). Visualization and Mathematics III (2003), Springer, Berlin 163-188
37. Farouki R.T., Moon H.P., and Ravani B. Algorithms for Minkowski products and implicitly-defined complex sets. Adv. Comput. Math. 13 (2000) 199-229
38. Farouki R.T., Moon H.P., and Ravani B. Minkowski geometric algebra of complex sets. Geom. Dedicata 85 (2001) 283-315
39. Farouki R.T., and Neff C.A. Analytic properties of plane offset curves & Algebraic properties of plane offset curves. Comput. Aided Geom. Design 7 (1990) 83-99, 101-127
40. Farouki R.T., and Pottmann H. Exact Minkowski products of N complex disks. Reliab. Comput. 8 (2002) 43-66
41. Fowler R.H. The Elementary Differential Geometry of Plane Curves (1929), Cambridge University Press, Cambridge
42. Ganter M., and Uiker J. Dynamic collision detection using swept solids. ASME J. Mech. Transmissions, Automat. Design 108 (1986) 549-555
43. Ghosh P.K. A mathematical model for shape description using Minkowski operators. Comput. Vision Graphics Image Process. 44 (1988) 239-269
44. Gonzalez-Vega L., and Necula I. Efficient topology determination of implicitly defined algebraic plane curves. Comput. Aided Geom. Design 19 (2002) 719-743
45. Grandine T.A., and Klein F.W. A new approach to the surface intersection problem. Comput. Aided Geom. Design 14 (1997) 111-134
46. Hadwiger H. Vorlesungen über Inhalt, Oberfläche, und Isoperimetrie (1957), Springer, Berlin
47. Hartquist E.E., Menon J.P., Suresh K., Voelcker H.B., and Zagajac J. A computing strategy for applications involving offsets, sweeps, and Minkowski operators. Comput. Aided Design 31 (1999) 175-183
48. J. Hass, R.T. Farouki, C.Y. Han, X. Song, T.W. Sederberg, Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme, Adv. Comput. Math., 2006, to appear.
49. Hernandez Barrera A. Computing the Minkowski sum of monotone polygons. IEICE Trans. Inform. Syst. E80D (1997) 218-222
50. Hong H. An efficient method for analyzing the topology of plane real algebraic curves. Math. Comput. Simulation 42 (1996) 571-582
51. Hwang H.K. A Poisson geometric convolution law for the number of components in unlabelled combinatorial structures. Combin. Probab. Comput. 7 (1998) 89-110
52. Imani B.M., and Elbestawi M.A. Geometric simulation of ball-end milling operations. ASME J. Manufact. Sci. Eng. 123 (2001) 177-184
53. Karunakaran K.P., Shanmuganathan P.V., Gupta N., and Isaac M. Swept volume of a generic cutter. J. Eng. Manuf. 214 (2000) 915-938
54. A. Kaul, Computing Minkowski sums, Ph.D. Thesis, Columbia University, 1993.
55. Kaul A., and Farouki R.T. Computing Minkowski sums of plane curves. Internat. J. Comput. Geometry Appl. 5 (1995) 413-432
56. Kaul A., and Rossignac J.R. Solid interpolating deformations: construction and animation of PIPS. Comput. Graphics 16 (1992) 107-115
57. Kieffer J., and Litvin F.L. Swept volume determination and interference detection for moving 3D solids. ASME J. Mech. Design 113 (1991) 456-463
58. Kim M.S., Ahn J.W., and Lim S.B. An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object. Inform. Process. Lett. 47 (1993) 221-229
59. Kim Y.J., Varadhan G., Lin M.C., and Manocha D. Fast swept volume approximation of complex polyhedral models. Comput. Aided Design 36 (2004) 1013-1027
60. Lee I.K., and Kim M.S. Polynomial/rational approximation of Minkowski sum boundary curves. Graph. Models Image Process. 60 (1998) 136-165
61. Lee I.K., Kim M.S., and Elber G. New approximation methods of planar offset and convolution curves. In: Strasser W., Klein R., and Rau R. (Eds). Geometric Modeling: Theory and Practice (1997), Springer, Berlin 83-101
62. Leu M.C., Park S.H., and Wang K.K. Geometric representation of translational swept volumes and its applications. ASME J. Eng. Industry 108 (1986) 113-119
63. Ling Z.K., and Chase T. Generating the swept area of a body undergoing planar motion. ASME J. Mech. Design 118 (1996) 221-223
64. Ling Z.K., and Hu Z.J. Use of swept volumes in the design of interference free spatial mechanisms. Mechanism Mach. Theory 32 (1997) 459-476
65. Lozano-Pérez T., and Wesley M.A. An algorithm for planning collision-free paths among polyhedral obstacles. Comm. ACM 22 (1979) 560-570
66. Maiteh B.Y., Blackmore D., Abdel-Malek K., and Leu M.C. Swept-volume computation for machining simulation and virtual reality application. J. Mat. Process. Manuf. Sci. 7 (1999) 380-390
67. Martin R.R., and Stephenson P.C. Sweeping of three dimensional objects. Comput. Aided Design 22 (1990) 223-234
68. Middleditch A.E. Applications of a vector sum operator. Comput. Aided Design 20 (1988) 183-188
69. Milnor J. Morse Theory (1963), Princeton University Press, Princeton, NJ
70. Minkowski H. Volumen und Oberfläche. Math. Ann. 57 (1903) 447-495
71. Moore R.E. Interval Analysis (1966), Prentice-Hall, Englewood Cliffs, NJ
72. Parida L., and Mudur S.P. Computational methods for evaluating swept object boundaries. Visual Comput. 10 (1994) 266-276
73. Petković M.S., and Petković L.D. Complex Interval Arithmetic and its Applications (1998), Wiley-VCH, Berlin
74. Ramamurthy R., and Farouki R.T. Voronoi diagram and medial axis algorithm for planar domains with curved boundaries I. Theoretical foundations & II. Detailed algorithm description. J. Comput. Appl. Math. 102 (1999) 119-141, 253-277
75. Rossignac J.R., and Requicha A.A.G. Offsetting operations in solid modelling. Comput. Aided Geom. Design 3 (1986) 129-148
76. Roy M.-F., and Szpirglas A. Complexity of the computation of cylindrical decomposition and topology of real algebraic curves using Thom's Lemma. Lecture Notes in Mathematics vol. 1420 (1990), Springer, Berlin 223-236
77. Sakkalis T. The topological configuration of a real algebraic curve. Bull. Austral. Math. Soc. 43 (1991) 37-50
78. Sambandan K., Kedem K., and Wang K.K. Generalized planar sweeping of polygons. J. Manuf. Syst. 11 (1992) 246-257
79. Serra J. Image Analysis and Mathematical Morphology (1982), Academic Press, London
80. Serra J. Introduction to mathematical morphology. Comput. Vision Graphics Image Process. 35 (1986) 283-305
81. Song X., Sederberg T.W., Zheng J., Farouki R.T., and Hass J. Linear perturbation methods for topologically consistent representations of free-form surface intersections. Comput. Aided Geom. Design 21 (2004) 303-319
82. Uspensky J.V. Theory of Equations (1948), McGraw-Hill, New York
83. Wang G.P., Sun J.G., and Hua X.J. The sweep-envelope differential equation for general deformed swept volumes. Comput. Aided Geom. Design 17 (2000) 399-418
84. Wang W.P., and Wang K.K. Geometric modeling for swept volume of moving solids. IEEE Comput. Graphics Appl. 6 12 (1986) 8-17
85. Weinert K., Du S.J., Damm P., and Stautner M. Swept volume generation for the simulation of machining processes. Internat. J. Mach. Tools Manuf. 44 (2004) 617-628
86. Weld J.D., and Leu M.C. Geometric representation of swept volumes with application to polyhedral objects. Internat. J. Robot. Res. 9 (1990) 105-117
87. Yang J.Z., and Abdel-Malek K. Approximate swept volume of NURBS surfaces or solids. Comput. Aided Geom. Design 22 (2005) 1-26