Radiance interpolants for accelerated bounded-error ray tracing

被引:34
|
作者
Bala, K [1 ]
Dorsey, J [1 ]
Teller, S [1 ]
机构
[1] MIT, Comp Sci Lab, Cambridge, MA 02139 USA
来源
ACM TRANSACTIONS ON GRAPHICS | 1999年 / 18卷 / 03期
关键词
data structures; error bounds; interactive; 4D interpolation; interval arithmetic; radiance approximation; rendering; rendering systems; visibility;
D O I
10.1145/336414.336417
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Ray tracers, which sample radiance, are usually regarded as offline rendering algorithms that are too slow for interactive use. In this article we present a system that exploits object-space, ray-space, image-space, and temporal coherence to accelerate ray tracing. Our system uses per-surface interpolants to approximate radiance while conservatively bounding error. The techniques introduced in this article should enhance both interactive and batch ray tracers. Our approach explicitly decouples the two primary operations of a ray tracer-shading and visibility determination-and accelerates each of them independently. Shading is accelerated by quadrilinearly interpolating lazily acquired radiance samples. Interpolation error does not exceed a user-specified bound, allowing the user to control performance/quality tradeoffs. Error is bounded by adaptive sampling at discontinuities and radiance nonlinearities. Visibility determination at pixels is accelerated by reprojecting interpolants as the user's viewpoint changes. A fast scan-line algorithm then achieves high performance without sacrificing image quality. For a smoothly varying viewpoint, the combination of lazy interpolants and reprojection substantially accelerates the ray tracer. Additionally, an efficient cache management algorithm keeps the memory footprint of the system small with negligible overhead.
引用
收藏
页码:213 / 256
页数:44
相关论文
共 50 条