Advertisement

The Visual Computer

, Volume 9, Issue 2, pp 91–104 | Cite as

Interval Ray Tracing — a divide and conquer strategy for realistic computer graphics

  • Wolfgang Enger
Article

Abstract

A new method for ray tracing parametric surfaces is developed. The method uses a divide-and-conquer strategy for rapid finding of the sectors of constant intensity. Techniques from interval analysis allow reducing the number of ray/surface intersections that must be computed. Main results are presented in terms of solving a general system of nonlinear equations, and thus can be extended to a large class of problems. Examples with B-spline surfaces demonstrate an improvement in computation time over a conventional method with a factor between 1.5 and 3.0. Additionally, a way of preventing “cracks” in triangulating parametric surfaces is shown.

Key words

Ray tracing Interval analysis Parametric surfaces B-splines Triangulation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alefeld G, Herzberger J (1983) Introduction to interval computation. Academic Press, New YorkGoogle Scholar
  2. Baumann E (1988) Optimal centered forms. BIT 28:80–87Google Scholar
  3. Bloomenthal J (1988) Polygonization of implicit surfaces. Comput Aided Geometric Design 5:341–355CrossRefGoogle Scholar
  4. deBoor C (1978) A practical gude to splines. Springer, Berlin Heidelberg New YorkGoogle Scholar
  5. Clay RD, Moreton HP (1988) Efficient adaptive subdivision of Bézier surfaces. In: Proc Eurographics. North-Holland, Amsterdam, pp 357–377Google Scholar
  6. Cohen E, Lyche T, Riesenfeld R (1980) Discrete B-splines and subdivision techniques in Computer Aided Geometric Design and Computer Graphics. Comput Graph Image Proc 14:87–111CrossRefGoogle Scholar
  7. Dussel R, Schmitt B (1970) Die Berechnung von Schranken für den Wertebereich eines Polynoms in einem Intervall. Computing 6:35–60Google Scholar
  8. Enger W (1990) Intervall Ray Tracing-ein Divide-and-Conquer Verfahren für photorealistische Computergrafik. Thesis, Institut für Angewandte Mathematik, Universität FreiburgGoogle Scholar
  9. Favin GE (1990) Curves and surfaces in computer aided geometric design, (2nd edn). Academic Press, San DiegoGoogle Scholar
  10. Faux ID, Pratt MJU (1979) Computational geometry for design and manufacture. Ellis Horwood, ChichesterGoogle Scholar
  11. Fujimoto A, Iwata K (1986) ARTS: accelerated ray-tracing systems. IEEE Comput Graph Appl 16–27Google Scholar
  12. Glassner AS (1984) Space subdivision for fast ray tracing. IEEE Comput Graph Appl 15–22Google Scholar
  13. Glassner AS (1988) Spacetime ray tracing for animation. IEEE Comput Graph Appl 60–70Google Scholar
  14. Glassner AS (1989) An introduction to ray tracing. Academic Press, San DiegoGoogle Scholar
  15. Koparkar PA, Mudur SA (1985) Subdivision techniques for processing geometric objects. In: Earnshaw RA (ed) Fundamental algorithms for computer graphics. Springer, New York Berlin Heidelberg, pp 751–801Google Scholar
  16. Krawczyk R (1969) Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing 4:187–201Google Scholar
  17. Lane JM, Carpenter LC, Whitted T, Blinn JF (1980) Scan line methods for displaying parametrically defined surfaces. Commun ACM 23:23–34CrossRefGoogle Scholar
  18. Moore RE (1966) Interval analysis. Prentice-Hall, Englewood CliffsGoogle Scholar
  19. Mudur SA, Koparkar PA (1984) Interval methods for processing geometric objects. IEEE Comput Graph Appl 7–17Google Scholar
  20. Müller H (1988) Realistische Computergrafik. Informatik-Fachberichte 163, Springer, Berlin Heidelberg New YorkGoogle Scholar
  21. Neumaier A (1988a) The enclosure of solutions of parameter dependent systems of equations. In: Moore RE (ed) Reliability in computing—the role of interval methods in scientific computing. Academic Press, San Diego, pp 269–286Google Scholar
  22. Neumaier A (1988b) Einführung in die Numerische Mathematik. Vorlesungsskript, Teil 3, Institut für Angewandte mathematik, Universität FreiburgGoogle Scholar
  23. Neumaier A (1990) Interval methods for systems of equations. Cambridge University Press, CambridgeGoogle Scholar
  24. Nishita T, Sederberg T, Kakimoto M (1990) Ray tracing trimmed rational surface patches. Comput Graph 24:337–345Google Scholar
  25. Pulleyblank R, Kapenga J (1987) The feasibility of a VLSI chip for ray tracing bicubic patches. IEEE Comput Graph Appl 7:33–44Google Scholar
  26. Rokne J (1982) Optimal computation of the Bernstein algorithm for the bound of an interval polynomial. Computing 28:239–246Google Scholar
  27. Schmitt A, Müller H, Leister W (1988) Ray tracing algorithms — theory and practice. In: Earnshaw RA (ed) Theoretical foundations of computer graphics and CAD. Springer, NATO ASI Series F 40:997–1029Google Scholar
  28. Thirion JP (1990) Utilisation de la cohérence de rayons lumineux pour le lancer de rayons. Thesis, Université de Paris-SudGoogle Scholar
  29. Toth DL (1985) On ray tracing parametric surfaces. SIGGRAPH 19:171–179Google Scholar
  30. Whitted T (1980) An improved illunination model for shaded display. Commun ACM 23:343–349CrossRefGoogle Scholar
  31. Woodward C (1989) Ray tracing parametric surfaces by subdivision in viewing plane. In: Strasser W, Seidel HP (eds) Theory and practice of geometric modelling, Springer, Berlin Heidelberg New York, pp 273–290Google Scholar
  32. Yamaguchi K, Kunii TL, Fujimura K, Toriya H (1984) Octreerelated data structures and algorithms. IEEE Comput Graph Appl 4:53–59Google Scholar

Copyright information

© Springer-Verlag 1992

Authors and Affiliations

  • Wolfgang Enger
    • 1
  1. 1.Institut für Angewandte MathematikUniversität FreiburgFreiburgFederal Republic of Germany

Personalised recommendations