Real‐Time Defocus Rendering With Level of Detail and Sub‐Sample Blur
Abstract
This paper presents a GPU‐based rendering algorithm for real‐time defocus blur effects, which significantly improves the accumulation buffering. The algorithm combines three distinctive techniques: (1) adaptive discrete geometric level of detail (LOD), made popping‐free by blending visibility samples across the two adjacent geometric levels; (2) adaptive visibility/shading sampling via sample reuse; (3) visibility supersampling via height‐field ray casting. All the three techniques are seamlessly integrated to lower the rendering cost of smooth defocus blur with high visibility sampling rates, while maintaining most of the quality of brute‐force accumulation buffering.This paper presents a GPU‐based rendering algorithm for real‐time defocus blur effects, which significantly improves the accumulation buffering. The algorithm combines three distinctive techniques: (1) adaptive discrete geometric level of detail (LOD), made popping‐free by blending visibility samples across the two adjacent geometric levels; (2) adaptive visibility/shading sampling via sample reuse; (3) visibility supersampling via height‐field ray casting. All the three techniques are seamlessly integrated to lower the rendering cost of smooth defocus blur with high visibility sampling rates, while maintaining most of the quality of brute‐force accumulation buffering.
BibTeX
@article {10.1111:cgf.12075,
journal = {Computer Graphics Forum},
title = {{Real‐Time Defocus Rendering With Level of Detail and Sub‐Sample Blur}},
author = {Jeong, Yuna and Kim, Kangtae and Lee, Sungkil},
year = {2013},
publisher = {The Eurographics Association and Blackwell Publishing Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/cgf.12075}
}
journal = {Computer Graphics Forum},
title = {{Real‐Time Defocus Rendering With Level of Detail and Sub‐Sample Blur}},
author = {Jeong, Yuna and Kim, Kangtae and Lee, Sungkil},
year = {2013},
publisher = {The Eurographics Association and Blackwell Publishing Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/cgf.12075}
}