Skip to main content
Log in

A unified algorithm for finding the intersection curve of surfaces

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this papaer, an INTEGRAL CURVE ALGORITHM is presented, which turns the intersection curve of surfaces into the form of integral one and then uses “PREDICTORCORRECTOR” technique to evaluate the intersection of surfaces.

No matter how the surfaces are defined, the method always deals with the intersection curves in the same way. To find a point on the curve one need only to calculate the JACOBI determinants of “PREDICTOR point” and “CORRECTOR point” while the second order precision is guatanteed. Thus, not only is the problem of finding the intersection of surfaces resolved, but also the algorithms for generating both plane curve and space curve are unified.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J Bresenham. A linear algorithm for incremental display of circular arcs.CACM, 1977, 20:100–106.

    MATH  Google Scholar 

  2. C W Gear. Numerical Initial Value Problems in Ordinary Differential Equations. Prentice-Hall, 1971.

  3. Q S Peng. An algorithm for finding the intersection lines between two B-spline surfaces.Computer Aided Design, 1984, 16(4).

  4. Tor Dokken. Finding intersections of B-spline represented geometrics using recursive subdivision techniques.Computer Aided Geometric Design, 1985, 2.

  5. N M Patrikalakis, P V Prakash. Surface intersections for geometric modelling.Transactions of the ASME, 1990, 112.

  6. C Asteasu, Intersection of arbitrary surfaces.Computer Aided Design, 1988, 20(9).

  7. C L Bajaj, C M Hoffmann, R E Lynch, J E H Hopcroft. Tracing surface intersections.Computer Aided Geometric Design, 1988, 5.

  8. J J Chen and T M Ozsoy. Predictor-corrector type of intersection algorithm for C parametric surfaces.Computer Aided Design, 1982, 20(3).

  9. Wayne E Carlson. An algorithm and data structure for 3D object synthesis using surface patch intersection.Computer Graphics 1982, 16(3).

  10. J M Lane, L C Carpenter. San line methods for displaying parametrically defined surfaces.Communications ACM, 1980, 23(1).

  11. J H Clark. A fast scan-line algorithm for rendering parametric surfaces.Computer Graphics (SIGGRAPH 79 supplement), 1979, 13(3)

  12. E Cohen, T Lyche, F Riesenfeld. Discrete B-spline and subdivision techniques in computeraided geometric design and computer graphics.Computer Graphics and Image Processing, 1980, 4(2).

  13. R E Barnhill, G Farin, M Jordan, B R Piper. Surface/surface intersection.Computer Aided Geometric Design, 1987, 4: 3–16.

    Article  MATH  MathSciNet  Google Scholar 

  14. E G Houghton, R F Emnett, J D Factor, C L Sabharwal. Implementation of a divide-conquer method for intersection of parametric surfaces.Computer Aided Geometric Design, 1985, 2: 173–183.

    Article  MATH  Google Scholar 

  15. M B Phillips, G M Odell. An algorithm for locating and displaying the intersection of two arbitrary surfaces.IEEE CG & A, 1984: 48–58.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work is supported in part by National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tan, J., Zheng, J. & Peng, Q. A unified algorithm for finding the intersection curve of surfaces. J. of Compt. Sci. & Technol. 9, 107–116 (1994). https://doi.org/10.1007/BF02939492

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02939492

Keywords

Navigation