论文信息 - Robust ray intersection with interval arithmetic

Robust ray intersection with interval arithmetic

For more general types of equations f (t) = 0, the problem of finding roots can be divided into two steps. First the roots must be isolated by finding intervals [ti , ti+1] which are known to contain one and only one root of the function. Secondly, the intervals about each root can be refined by reducing the size of the isolating interval until the root is located as accurately as possible using machine arithmetic.

D. P. Mitchell

[1] K. Madsen. A root-finding algorithm based on Newton's method , 1973 .

[2] Bush Jones,et al. Root isolation using function values , 1978 .

[3] Barr,et al. Superquadrics and Angle-Preserving Transformations , 1981, IEEE Computer Graphics and Applications.

[4] James F. Blinn,et al. A Generalization of Algebraic Surface Drawing , 1982, TOGS.

[5] Pat Hanrahan,et al. Ray tracing algebraic surfaces , 1983, SIGGRAPH.

[6] G. E. Collins,et al. Real Zeros of Polynomials , 1983 .

[7] Alan H. Barr,et al. Global and local deformations of solid primitives , 1984, SIGGRAPH.

[8] Daniel L. Toth,et al. On ray tracing parametric surfaces , 1985, SIGGRAPH.

[9] Jarke J. van Wijk,et al. Ray tracing objects defined by sweeping a sphere , 1984, Comput. Graph..

[10] R. B. Kearfott,et al. Abstract generalized bisection and a cost bound , 1987 .

[11] Devendra Kalra,et al. Guaranteed ray intersections with implicit surfaces , 1989, SIGGRAPH.