Advances in Computational Mathematics

, Volume 2, Issue 1, pp 1–21 | Cite as

NURBS approximation of surface/surface intersection curves

  • Chandrajit L. Bajaj
  • Guoliang Xu


We use a combination of both symbolic and numerical techniques to construct degree boundedC k -continuous, rational B-spline ε-approximations of real algebraic surface-surface intersection curves. The algebraic surfaces could be either in implicit or rational parametric form. At singular points, we use the classical Newton power series factorizations to determine the distinct branches of the space intersection curve. In addition to singular points, we obtain an adaptive selection of regular points about which the curve approximation yields a small number of curve segments yet achievesC k continuity between segments. Details of the implementation of these algorithms and approximation error bounds are also provided.


Singular Point Algebraic Curf Newton Iteration Algebraic Surface Intersection Curve 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C. Bajaj, Geometric modeling with algebraic surfaces,The Mathematics of Surfaces III, ed. D. Handscomb (Oxford University Press, 1990) pp. 3–48.Google Scholar
  2. [2]
    C. Bajaj, The emergence of algebraic curves and surfaces in geometric design,Directions in Geometric Computing, ed. R. Martin (Information Geometers Press, UK, 1993) pp. 1–29.Google Scholar
  3. [3]
    C. Bajaj and I. Ihm, Algebraic surface design with Hermite interpolation, ACM Trans. Graphics 11(1992)61–91.zbMATHCrossRefGoogle Scholar
  4. [4]
    C. Bajaj and A. Royappa, The GANITH algebraic geometry toolkit, in:Proc. 1 st Int. Symp. on the Design and Implementation of Symbolic Computation Systems, Lecture Notes in Computer Science No. 429 (Springer, 1990) pp. 268–269.Google Scholar
  5. [5]
    C.L. Bajaj and G. Xu, Piecewise rational approximation of real algebraic curves, CAPO Technical Report 92-19, Computer Science Department, Purdue University (1992).Google Scholar
  6. [6]
    C.L. Bajaj and G. Xu, Converting a rational curve to a standard rational Bézier representation, to appear inGRAPHICS GEMS IV ed. P. Heckbert (Academic Press, New York, 1994).Google Scholar
  7. [7]
    C. Bajaj, C. Hoffmann, R. Lynch and J. Hopcroft, Tracing surface intersections, Comp. Aided Geom. Design 5(1988)285–307.zbMATHMathSciNetCrossRefGoogle Scholar
  8. [8]
    K. Cheng, Using plane vector fields to obtain all the intersection curves of two general surfaces,Theory and Practice of Geometric Modeling, ed. W. Strasser and H.-P. Seidel (Springer, Berlin, 1989) pp. 187–204.Google Scholar
  9. [9]
    C. de Boor,A Practical Guide to Splines (Springer, New York/Heidelberg/Berlin, 1978).zbMATHGoogle Scholar
  10. [10]
    M. do Carmo,Differential Geometry of Curves and Surfaces (Prentice-Hall, Englewood Cliffs, NJ, 1976).zbMATHGoogle Scholar
  11. [11]
    G. Farin,Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide (Academic Press, Boston, 1988).Google Scholar
  12. [12]
    T. Garrity and J. Warren, On computing the intersection of a pair of algebraic surfaces, Comp. Aided Geom. Design 6(1989)137–153.zbMATHMathSciNetCrossRefGoogle Scholar
  13. [13]
    T. Garrity and J. Warren, Geometric continuity, Comp. Aided Geom. Design 8(1991)51–65.zbMATHMathSciNetCrossRefGoogle Scholar
  14. [14]
    A. Geisow, Surface interrogations, Ph.D. Thesis, University of East Anglia (1983).Google Scholar
  15. [15]
    R. Goldman and C. Micchelli, Algebraic aspects of geometric continuity, in:Mathematical Methods in Computer Aided Geometric Design, ed. T. Lyche and L. Schumaker (Academic Press, Boston, 1989) pp. 313–332.Google Scholar
  16. [16]
    H. Guggenheimer, Computing frames along a trajectory, Comp. Aided Geom. Design 6(1989) 77–78.zbMATHMathSciNetCrossRefGoogle Scholar
  17. [17]
    G. Müllenheim, Convergence of a surface/surface intersection algorithm, Comp. Aided Geom. Design 7(1990)415–423.zbMATHCrossRefGoogle Scholar
  18. [18]
    G. Müllenheim, On determining start points for a surface/surface intersection algorithm, Comp. Aided Geom. Design 8(1991)401–408.zbMATHCrossRefGoogle Scholar
  19. [19]
    H. Padé, Sur la généralisation des fractions continues algébriques, J. de Math. 4(1894)291–329.zbMATHGoogle Scholar
  20. [20]
    L. Peigl and W. Tiller, Curves and surface construction using rational B-splines, Comp. Aided Design 19(1987)485–498.CrossRefGoogle Scholar
  21. [21]
    M. Pratt and A. Geisow, Surface/surface intersection problems,The Mathematics of Surfaces, ed. J. Gregory (Oxford University Press, 1986) pp. 117–142.Google Scholar
  22. [22]
    M.A. Sabin, Contouring—the state of the art, NATO ASI Series,Fundamental Algorithms for Computer Graphics, F17(1985) pp. 411–482.Google Scholar
  23. [23]
    T. Sederberg, J. Zhao and A. Zundel, Rational approximation of algebraic curves, in:Theory and Practice of Geometric Modeling, ed. W. Strasser and H.-P. Seidel (Springer) pp. 33–54.Google Scholar
  24. [24]
    T. Sederberg and T. Nishita, Geometric Hermite approximation of surface patch intersection curves, Comp. Aided Geom. Design 8(1991)97–114.zbMATHMathSciNetCrossRefGoogle Scholar
  25. [25]
    H.-P. Seidel, Polar forms for geometrically continuous spline curves of arbitrary degree, ACM Trans. Graphics 12(1993)1–34.zbMATHCrossRefGoogle Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1994

Authors and Affiliations

  • Chandrajit L. Bajaj
    • 1
  • Guoliang Xu
    • 2
  1. 1.Department of Computer SciencePurdue UniversityWest LafayetteUSA
  2. 2.Computer CenterChinese Academy of SciencesBeijingPR China

Personalised recommendations