Abstract
The generation of ray traced images of a variety of surfaces plays a central role in computer graphics. One of the main operations in ray tracing is the calculation of intersections between rays and surfaces. In case of implicitly given surfaces the intersection problem can be formulated as that of finding the smallest non-negative root of an equation in one variable. If the root finding is carried out by means of conventional numerical methods based on point sampling (such as bisection, regula-falsi or Newton) the resulting image can be wrong, e.g. when the surface is thin the ray may "miss" the surface, which may result in an image with background color spots on the surface. To obtain robust intersection detection, methods based either on Lipschitz constants for the function and its derivative or an interval inclusions for the function and its derivative have been suggested. In this paper robust methods are obtained with interval inclusions in a variant of Alefeld-Hansens globally convergent method for computing and bounding all the roots of a single equation. Alefeld-Hansens method has been modified so instead of searching for all roots, a recursive depth-first search is carried out to obtain the smallest non-negative root. When compared to other methods suggested, it is found that this variant of Alefeld-Hansens method is not only robust but also an efficient method for finding the ray intersections.
Similar content being viewed by others
References
Alefeld, G.: Eine Modifikation des Newtonverfarens zur Bestimmung der reellen Nullstellen einer reellen Funktion, ZAMM 50, T32-T33 (1970).
Alefeld, G.: On the Speed of Divergence of Some Newton-Like Enclosure Methods, in: Interval'98, International Conference on Interval Methods and Their Applications, Nanjing University, P.R. China, 1998, p. 4.
Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, 1983.
Glassner, A. S. (ed.): An Introduction to Ray Tracing, Academic Press, 1989.
Hanrahan, P.: A Survey of Ray-Surface Intersection Algorithms, in [4].
Hansen, E.: Globally Convergent Interval Method for Computing and Bounding Real Roots, BIT 18 (1978), pp. 415-424.
Hansen, E.: Global Optimization Using Interval Analysis, Pure and Applied Mathematics, Marcel Dekker, 1992.
Hart, J. C.: Sphere Tracing: A Geometric Method for the Antialiased Ray Tracing of Implicit Surfaces, The Visual Computer 12 (1996), pp. 527-545.
Jensen, D. W. and Reed, D. A.: A Performance Analysis Exemplar: Parallel Ray Tracing, Concurrency: Practice and Experience 4(2) (1992), pp. 119-141.
Kalra, D. and Barr, A. H.: Guaranteed Ray Intersection with Implicit Surfaces, Computer Graphics 23(3) (1989).
Knüppel, O.: PROFIL/BIAS—A Fast Interval Library, Computing 53 (1994), pp. 277-287.
Mitchell, D. P.: Robust Ray Intersection with Interval Arithmetic, in: Proceedings of Graphics Interface '90, 1990, pp. 68-74.
Moore, R.: Interval Analysis, Prentice Hall, Englewood Cliffs, NJ, 1966.
Mudur, S. P. and Koparkar, P. A.: Interval Methods for Processing Geometric Objects, IEEE Computer Graphics & Appl. 4 (1984), pp. 7-17.
Press, W. H. et al.: Numerical Recipies in C, Cambridge University Press, 1992.
Suffern, K. G. and Fackerell, E. D.: Interval Methods in Computer Graphics, Computers & Graphics 15(3) (1991), pp. 331-340.
Toth, D. L.: On Ray Tracing Parametric Surfaces, SIGGRAPH 19(3) (1985), pp. 171-179.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Caprani, O., Hvidegaard, L., Mortensen, M. et al. Robust and Efficient Ray Intersection of Implicit Surfaces. Reliable Computing 6, 9–21 (2000). https://doi.org/10.1023/A:1009921806032
Issue Date:
DOI: https://doi.org/10.1023/A:1009921806032