Skip to main content
Log in

Intersection problems of parametric surfaces in CAGD

Schnittprobleme parametrisierter Flächen im CAGD

  • Published:
Computing Aims and scope Submit manuscript

Abstract

In Computer Aided Geometric Design the task of computing intersections between surfaces must be performed by numerical methods. In the present paper a new kind of marching method is considered which employs interval arithmetic for proofing the correct topology of the solution set.

Zusammenfassung

Im CAGD müssen Schnitte von Flächen numerisch berechnet werden. In der vorliegenden Arbiet wird eine neue Vorwärtsschritt-Methode betrachtet, bei der die Richtigkeit der Topologie der Lösungsmenge mit Hilfe von Intervallarithmetrik bewiesen wird.

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. Alefeld, G., Herzberger, J.: Introduction to interval computations. New York: Academic Press 1983.

    Google Scholar 

  2. Allgower, E. L., Georg, K.: Numerical continuation methods. Berlin Heidelberg New York Tokyo: Springer 1990.

    Google Scholar 

  3. Barnhill, R. E., Farin, G., Jordan, M., Piper, B. R.: Surface/surface intersection. Computer Aided Geometric Design4, 3–16 (1987).

    Article  MathSciNet  Google Scholar 

  4. Kearfott, R. B., Xing, Z.: Rigorous computation of surface patch intersection curves. Computer Aided Geometric Design (to appear).

  5. Klatte, R., Kulisch, U., Neaga, M., Ratz, D., Ullrich, Ch.: PASCAL-XSC language reference with examples. Berlin Heidelberg New York Tokyo: Springer 1991.

    Google Scholar 

  6. Lohner, R. J.: Einschliessung bei gewoehnlichen Anfangs- und Randwertaufgaben. Dissertation, Karlsruhe 1988.

  7. Moore, R. E.: Interval analysis. Englewood Cliffs: Prentice-Hall 1966.

    Google Scholar 

  8. Muellenheim, G.: On determining start points for a surface/surfave intesection algorithm. Computer Aided Geometric Design8, 401–408 (1991).

    MATH  MathSciNet  Google Scholar 

  9. Neumaier, A.: Interval methods for systems of equations. Cambridge: Cambridge University, Press 1990.

    Google Scholar 

  10. Pratt, M. J., Geisow, A. D.: Surface/surface intersection problems. In: Gregory, J. A. (ed.): The mathematics of surfaces, pp. 117–142. Kensington: Clarendon Press 1986.

    Google Scholar 

  11. Stürzlinger, W., Tobler, R. F., Schindler, M.: FLIRT-faster than light ray tracer. Inst. f. Computergraphik, TU Vienna, 1991.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schramm, P. Intersection problems of parametric surfaces in CAGD. Computing 53, 355–364 (1994). https://doi.org/10.1007/BF02307385

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation