skip to main content
article
Free Access

Algebraic surface design with Hermite interpolation

Authors Info & Claims
Published:02 January 1992Publication History
Skip Abstract Section

Abstract

This paper presents an efficient algorithm called Hermite interpolation, for constructing low-degree algebraic surfaces, which contain, with C1 or tangent plane continuity, any given collection of points and algebraic space curves having derivative information. Positional as well as derivative constraints on an implicitly defined algebraic surface are translated into a homogeneous linear system, where the unknowns are the coefficients of the polynomial defining the algebraic surface. Computaional details of the Hermite interpolation algorithm are presented along with several illustrative applications of the interpolation technique to construction of joining or blending surfaces for solid models as well as fleshing surfaces for curved wire frame models. A heuristic approach to interactive shape control of implicit algebraic surfaces is also given, and open problems in algebraic surface design are discussed.

References

  1. 1 ABHYANKAR, S. S. Algebraic space curves. Univ. of Montreal, 1970. Montreal Lecture Notes.Google ScholarGoogle Scholar
  2. 2 ARNON, D., COLLINS, G., AND MCCALLUM, S. Cylindrical algebraic decomposition 1: The basic algorithm. SlAM J. Comput. 13, 4 (1984), 865-889. Google ScholarGoogle Scholar
  3. 3 BAJAJ, C., HOFFMANN, C., HOPCROFT, J., AND LYNCH, R. Tracing surface intersections. Comput. Aided Geom. Des. 5 (1988), 285-307. Google ScholarGoogle Scholar
  4. 4 BAJAJ, C., IHM, I., AND WARREN, J. Higher order interpolation and }east squares approximation using implicit algebraic surfaces. Tech. Rep. 91-035, Dept. of Computer Science, Purdue University, Apr. 1991.Google ScholarGoogle Scholar
  5. 5 BAJAJ, C., AND KIM, M.-S. Generation of configuration space obstacles: Moving algebraic surfaces. Int. J. Rob. Res. 9, i (1990), 92-112. Google ScholarGoogle Scholar
  6. 6 BARNHII,I., R. Surfaces in computer aided geometric design: A survey with new results. Comput. Aided Geom. Des. 2 (1985), 1-17.Google ScholarGoogle Scholar
  7. 7 BOHM, W., FARIN, G., AND KAHMANN, J. A survey of curve and surface methods in CAGD. Comput. Aided Geom. Des. I (1984), 1-60. Google ScholarGoogle Scholar
  8. 8 DAHMEN, W. Smooth piecewise quadratic surfaces. In Mathematical Methods in Computer Aided Geometric Design, T. Lyche and L. Schumaker, Eds., Academic Press, Boston, 1989, pp. 181-193. Google ScholarGoogle Scholar
  9. 9 DEBooR, C. A Practical Guide to Splines. Springer-Verlag, New York, 1978.Google ScholarGoogle Scholar
  10. 10 DERosE, A.D. Geometric continuity: A parameterization independent measure of continuity for computer aided geometric design. PhD thesis, Computer Science, Univ. of California, Berkeley, 1985. Google ScholarGoogle Scholar
  11. 11 FAmN, G. Triangular Bernstein-B~zier patches. Comput. Aided Geom. Des. 3 (1986). 83-127. Google ScholarGoogle Scholar
  12. 12 GARmmv, T., AND WARREN, J. Geometric continuity. Comput. Aided Geom. Des. 8 (1991), 51 65. Google ScholarGoogle Scholar
  13. 13 GOLDMAN, R.N. The role of surfaces in solid modeling. In Geometric Modeling.' Algorithm.~ and New Trends, G. Farin, Ed., SIAM, Philadelphia, 1987, pp. 69-90.Google ScholarGoogle Scholar
  14. 14 GoLtm, G. E., AND VAN LOAN, C.F. Matrix Computation. The Johns Hopkins Univ. Press, Baltimore, MD, 1983.Google ScholarGoogle Scholar
  15. 15 HOFI~'MANN, C., AND HOPCROFT, J. Quadratic blending surfaces. Comput. Aided Geom. Des. 18, 6 (1986), 301-306. Google ScholarGoogle Scholar
  16. 16 Mu)m.m)ITC,, A., ANt) SEARS, K. Blend surfaces for set theoretic volume modeling system. Comput. Graph. 19, 3 (1985), 161-170. Google ScholarGoogle Scholar
  17. 17 OWEN, J. C., aNI) Roc~wool), A. P. Blending surfaces in solid modeling. In Geometri( Modeling: Algorithms and New Trends, G. Farin, Ed., SIAM, Philadelphia, 1987, pp 367-383.Google ScholarGoogle Scholar
  18. 18 PRAU*r, V. Direct least squares fitting of algebraic surfaces. Comput. Graph. 21, 3 (1987) 145-152. Google ScholarGoogle Scholar
  19. 19 SEDFRBERC,, T. W. Piecewise algebraic surface patches. Comput. Aided Geom. Des. 2, 1-~q (1985), 53-59.Google ScholarGoogle Scholar
  20. 20 SEDERBER(;, T.W. Techniques for cubic algebraic surfaces. IEEE Comput. Graph. Appl. 10 5 (Sept. 1990), 12-21. Google ScholarGoogle Scholar
  21. 21 SEDF. RBE~(;, T. W. Techniques for cubic algebraic surfaces. IEEE Compul. Graph. Appl. 10 4 IJuly 1990), 14-25. Google ScholarGoogle Scholar
  22. 22 SEMPI,E, J., AN{) R{)TH, L. Introduction to Algebraic Geometry. Oxford University Press Oxford, U.K., 1949.Google ScholarGoogle Scholar
  23. 23 WALKUR, R. Algebraic Curves. Springer Verlag, New York, 1978.Google ScholarGoogle Scholar
  24. 24 WARREN, J. On algebraic surfaces meeting with geometric continuity. Ph.D. thesis, Cornel University, 1986. Google ScholarGoogle Scholar
  25. 25 WARREN, J. Blending algebraic surfaces. ACM Trans. Graph. 8, 4 (1989), 263-278. Google ScholarGoogle Scholar

Index Terms

  1. Algebraic surface design with Hermite interpolation

          Recommendations

          Reviews

          Nickolas S. Sapidis

          The problem of constructing an algebraic surface of the lowest degree that interpolates points of curves with normals ( C 1 interpolation) is addressed. The authors present a complete discussion of the problem and establish that the interpolants correspond to nontrivial solutions of a homogeneous linear system of equations. This result is translated into an algorithm, which is applied in a large number of test cases (examples) that clearly show the advantages of the proposed technique. The authors discuss, and demonstrate with an example, one of the major open problems in algebraic-surface modeling: often, the constructed interpolating surface is unsuitable for design applications because the interpolated points or curves lie on separate components of the same algebraic surface. This problem is only one instance of the more general issue of topological unpredictability that one faces when dealing with algebraic surfaces. Other instances of this phenomenon are extra branches that an interpolating algebraic surface may have (see Warren [1] and the references therein) and self-intersections. Another issue in algebraic-surface interpolation is that the result of C 1 interpolation is generally a q -parameter family of surfaces that may have drastically varying topological characteristics, as some of the examples in this paper demonstrate. Thus, one faces the problem of selecting from the above q -parameter family of interpolants a bounded, connected piece of a surface [1] that is appropriate for geometric modeling applications. For this purpose, the authors convert the interpolating surfaces to the Bernstein basis and attempt to control their shapes with NURBS-like control points and weights. This conversion requires the specification of a tetrahedron T enclosing the portion of the surface that is of interest. (The fact that this surface does not yet exist makes this part of the methodology vague.) The vertices of T directly determine the surface's control points. Finally, the weights are determined by various heuristics, user interaction, or both. This paper is an important contribution in the area of algebraic-surface interpolation. It will be useful to researchers as well as software developers considering implicit surfaces for geometric modeling applications.

          Access critical reviews of Computing literature here

          Become a reviewer for Computing Reviews.

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader