Abstract
This paper describes a new robust method to decompose a free-form surface into regions with specific range of curvature and provide important tools for surface analysis, tool-path generation, and tool-size selection for numerically controlled machining, tessellation of trimmed patches for surface interrogation and finite-element meshing, and fairing of free-form surfaces. The key element in these techniques is the computation ofall real roots within a finite box of systems of nonlinear equations involving polynomials and square roots of polynomials. The free-form surfaces are bivariate polynomial functions, but the analytical expressions of their principal curvatures involve polynomials and square roots of polynomials. Key components are the reduction of the problems into solutions of systems of polynomial equations of higher dimensionality through the introduction ofauxiliary variables and the use ofrounded interval arithmetic in the context of Bernstein subdivision to enhance the robustness of floating-point implementation. Examples are given that illustrate our techniques.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Banchoff T, Gaffney T, McCrory C (1982) Cusps of Gauss mappings. Pittman, Boston
Beck JM, Farouki RT, Hinds JK (1986) Surface analysis methods. IEEE Comput Graph Appl 6:18–36
Berry MV, Hannay JH (1977) Umbilic points on Gaussian random surfaces. J Physics A 10:1809–1821
Bliek C (1992) Computer methods for design automation. PhD thesis, Massachusetts Institute of Technology, Cambridge, Mass.
Darboux G (1896) Leçons sur la théorie générale des surfaces vol 4. Gauthier-Villars, Paris
Dill JC (1981) An application of color graphics to the display of surface curvature. Comput Graph 15:153–161
do Carmo PM (1976) Differential geometry of curves and surfaces, Prentice-Hall, Englewood Cliffs, NJ
Duff T (1992) Interval arithmetic and recursive subdivision for implicit functions and constructive solid geometry. ACM Comput Graph 26:131–138
Fraouki RT (1986) The approximation of non-degenerate offset strategy for realistic computer graphics. The Visual Comput 9:91–104
Farouki RT,(1986) The approximation of plandegenerate offset surfaces. Comput Aided Geometric Design 3:15–43
Farouki RT, Neff CA (1990) Algebraic properties of plane offset curves. Comput Aided Geometric Design 7:101–127
Faux ID, Pratt MJ (1981) Computational geometry for design and manufacture. John Wiley, Chichester, UK
Geisow A (1983) Surface interrogations. PhD thesis, School of Computing Studies and Accountancy. University of East Anglia, Norwich NR47TJ, UK
Hager GD (1992) Constraint solving methods and sensor-based decision making. Proc 1992 IEEE Int Conf Robotics and Automation, pp. 1662–1667
Hancock H (1960) Theory of maxima and minima. Dover, New York
Hilbert D, Cohn-Vossen S (1952) Geometry and the imagination, Chelsea, New York
Hottel GR, Tuohy St, Alourdas PG, Patrikalakis NM (1991) Praxiteles: a geometric modeling and interrogation system. Marine Computers '91: Proc 2nd Symp Computer Applications in the Marine Industry. Burlington, Mass. SNAME, New England Section. Paper CC5
Jerard RB, Drysdale RL, Schaudt B, Hauck K, Magewick J (1989) Methods for detecting errors in sculptured surface machining. IEEE Comput Graph Appl 9:26–39
Kearfott RB (1991) Decomposition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems. Computing 47:169–191
Koenderink JJ (1990) Solid shape. MIT Press. Cambridge, Mass.
Kriezis GA, Patrikalakis NM, Wolter F-E (1992) Topological and differential equation methods for surface intersections. Comput Aided Design 24:41–55
Kriezis GA, Prakash PV, Patrikalakis NM (1990) A method for intersecting algebraic surfaces with rational polynomial patches. Comput Aided Design 22:645–654
Maekawa T, Patrikalakis NM (1993) Computation of singularities and intersections of offsets of planar curves. Comput Aided Geometric Design (In press)
Maekawa T, Wolter F-E, Patrikalakis NM (1993) Umbilics and lines of curvature for shape interrogation. Design Laboratory Memorandum 93-4. MIT Department of Ocean Engineering, Cambridge, Mass.
Manocha D (1993) Solving polynomial systems for curve, suface and solid modelin. Proc 2nd ACM/IEEE Symp Solid Modeling and Applications. Montreal NY: ACM SIGGRAPH (In press) pp 169–178
Moore RE (1966) Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ
Mudur SP, Koparkar PA (1984) Interval methods for processing geometric objects. IEEE Comput Graph Appl 4:7–17
Munchmeyer FC (1987a) On surface imperfections. In: Martin R (ed) Mathematics of Surfaces II, Oxford University Press, Oxford, pp. 459–474
Munchmeyer FC (1987b) Shape interrogation: a case study. In: Farin G (ed) Geometric Modeling, SIAM, Philadelphia, pp 291–301
Neumaier A (1990) Interval Methods for Systems of Equations. Cambridge University Press, Cambridge
Nishita T, Sederberg TW, Kakimoto M (1990) Ray tracing trimmed rational surface patches. ACM Comput Graph 24:337–345
Numerical Algorithms Group, Oxford, UK (1991) NAG Fortran Library Manual, Volumes 1–8, Mark 15 edition
Patrikalakis NM (1993) Surface-to-surface intersections. IEEE Comput Graph Appl 13:89–95
Patrikalakis NM, Mackawa T, Sherbrooke EC, Zhou J (1992) Computation of singularities for engineering design. In: Kunit TL and Shinagawa Y (ed) Modern Geometric Computing for Visualizatio. Springer, Tokyo, pp 167–191
Patrikalakis NM, Prakash PV (1990) Surface intersections for geometric modeling. J Mech Design, ASME Trans 112:100–107
Prakash PV, Patrikalakis NM (1988) Surface-to-surface intersections for geometric modeling. Technical Report MITSG 88-8 Cambridge, Mass.
Preusser A (1986) Computing area filling contours for surface defined by piecewise polynomials. Comput Aided Geometric Design 3:267–279
Sederberg TW (1989) Algorithms for algebraic curve intersection. Comput Aided Design 21:547–554
Sederberg TW, Buehler DB (1992) Offsets of polynomial Bézier curves: Hermite approximation with error bounds. In: Lyche T and Schumaker LL (eds) Mathematical methods in computer aided geometric design, Vol. II. Academic Press, p. 549–558
Sederberg TW, Farouki RT (1992) Approximation by interval Bézier curves. IEEE Comput Graph Appl 12:87–95
Sherbrooke EC, Patrikalakis NM (1993) Computation of the solutions of nonlinear polynomial systems. Comput Aided Geometric Design (In Press)
Snyder JM (1992) Interval analysis for computer graphics. ACM Comput Graph 26:121–130
Struik DJ (1950) Lectures on classical differential geometry. Addison-Wesley, Cambridge, Mass.
Toth D (1985) On ray tracing parametric surfaces. ACM Comput Graph 19:171–179
Tuohy ST (1988) A comparison of ship surface design methods. Master's thesis, University of New Orleans. Department of naval Architecture and Marine Engineering, New Orleans
Tuohy ST, Maekawa T, Patrikalakis NM (1993) Interrogation of geophysical maps with uncertainty for AUV micro-navigation. Design Laboratory Memorandum 93-3, MIT. Department of Ocean Engineering, Cambridge, Mass.
Touhy ST, Patrikalakis NM (1993) Representation of geophysical maps with uncertainty. In: Thalmann NM, Thalmann D (eds) Communicating with Virtual Worlds '93. Springer, Tokyo, pp 179–192
Vafiadou ME, Patrikalakis NM (1991) Interrogation of offsets of polynomial surface patches. In: Post FH, Barth W (eds) Eurographics '91. Proc 12th Annual European Association for Computer Graphics Conf Exhibition, Vienna, North Holland, Amsterdam, pp 247–259, 538
Yamaguchi F (1988) Curves and Surfaces in Computer Aided Geometric Design. Springer, Berlin Heidelberg New York
Zhou J, Sherbrooke EC, Patrikalakis NM (1993) Computation of stationary points of distance functions. Eng Comput (In press)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Maekawa, T., Patrikalakis, N.M. Interrogation of differential geometry properties for design and manufacture. The Visual Computer 10, 216–237 (1994). https://doi.org/10.1007/BF01901288
Issue Date:
DOI: https://doi.org/10.1007/BF01901288