z-logo
Premium
Pre‐computed Gathering of Multi‐Bounce Glossy Reflections
Author(s) -
Laurijssen Jurgen,
Wang Rui,
Lagae Ares,
Dutré Philip
Publication year - 2011
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2011.02001.x
Subject(s) - computer science , computation , representation (politics) , global illumination , computer graphics (images) , reflection (computer programming) , exploit , hash function , function (biology) , computer vision , artificial intelligence , algorithm , rendering (computer graphics) , computer security , politics , political science , law , programming language , evolutionary biology , biology
Recent work in interactive global illumination addresses diffuse and moderately glossy indirect lighting effects, but high‐frequency effects such as multi‐bounce reflections on highly glossy surfaces are often ignored. Accurately simulating such effects is important to convey the realistic appearance of materials such as chrome and shiny metal. In this paper, we present an efficient method for visualizing multi‐bounce glossy reflections at interactive rates under environment lighting. Our main contribution is a pre‐computation–based method which efficiently gathers subsequent highly glossy reflection passes modelled with a non‐linear transfer function representation based on the von Mises–Fisher distribution. We show that our gathering method is superior to scattered sampling. To exploit the sparsity of the pre‐computed data, we apply perfect spatial hashing. As a result, we are able to visualize multi‐bounce glossy reflections at interactive rates at a low pre‐computation cost.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here