Adaptive Quantization Visibility Caching. (6th May 2013)

• Record Type: Journal Article
• Authors: Popov, Stefan; Georgiev, Iliyan; Slusallek, Philipp; Dachsbacher, Carsten
• Is Part Of: Computer graphics forum. Volume 32:Number 2(2013)Part 4
• Page Start: 399
• Page End: 408
• Publication Date: 2013-05-06
• Subjects: I.3.7 [Computer Graphics]: Color, shading, shadowing, and texture -- I.3.7 [Computer Graphics]: Ray tracing; Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.12060
• Languages: English
• ISSNs: 0167-7055

Abstract

Abstract: Ray tracing has become a viable alternative to rasterization for interactive applications and also forms the basis of most global illumination methods. However, even today's fastest ray‐tracers offer only a tight budget of rays per pixel per frame. Rendering performance can be improved by increasing this budget, or by developing methods that use it more efficiently. In this paper we propose a global visibility caching algorithm that reduces the number of shadow rays required for shading to a fraction of less than 2% in some cases. We quantize the visibility function's domain while ensuring a minimal degradation of the final image quality. To control the introduced error, we adapt the quantization locally, accounting for variations in geometry, sampling densities on both endpoints of the visibility queries, and the light signal itself. Compared to previous approaches for approximating visibility, e.g. shadow mapping, our method has several advantages: (1) it allows caching of arbitrary visibility queries between surface points and is thus applicable to all ray tracing based methods; (2) the approximation error is uniform over the entire image and can be bounded by a user‐specified parameter; (3) the cache is created on‐the‐fly and does not waste any resources on queries that will never be used. We demonstrate the benefits of our method on Whitted‐style ray tracing combined with instant radiosity, as well as an integration with bidirectional path tracing.