Rendering - Experimental Ideas & Implementations 2017

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/2631441

Browse

Browsing Rendering - Experimental Ideas & Implementations 2017 by Subject "Raytracing"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    k-d Tree Construction Designed for Motion Blur
    (The Eurographics Association, 2017) Yang, Xin; Liu, Qi; Yin, Baocai; Zhang, Qiang; Zhou, Dongsheng; Wei, Xiaopeng; Matthias Zwicker and Pedro Sander
    We present a k-d tree construction algorithm designed to accelerate rendering of scenes with motion blur, in application scenarios where a k-d tree is either required or desired. Our associated data structure focuses on capturing incoherent motion within the nodes of a k-d tree and improves both data structure quality and efficiency over previous methods. At build-time stage, we tracks primitives with motion that is significantly distinct from other primitives within the node, guarantee valid node references and the correctness of the data structure via primitive duplication heuristic and propagation rules. Our experiments with this hierarchy show artifact-free motion-blur rendering using a k-d tree, and demonstrate improvements against a traditional BVH with interpolation and a MSBVH structure designed to handle moving primitives, particularly in render time.
  • Thumbnail Image
    Item
    Local Quasi-Monte Carlo Exploration
    (The Eurographics Association, 2017) Tessari, Lorenzo; Hanika, Johannes; Dachsbacher, Carsten; Matthias Zwicker and Pedro Sander
    In physically-based image synthesis, the path space of light transport paths is usually explored by stochastic sampling. The two main families of algorithms are Monte Carlo/quasi-Monte Carlo sampling and Markov chain Monte Carlo. While the former is known for good uniform discovery of important regions, the latter facilitates efficient exploration of local effects. We introduce a hybrid sampling technique which uses quasi-Monte Carlo points to achieve good stratification in both stages: we use the Halton sequence to generate initial seed paths and rank-1 lattices for local exploration. This method avoids the hard problem of introducing QMC sequences into MCMC while still stratifying samples both globally and locally. We propose perturbation strategies that prefer dimensions close to the camera, facilitating efficient reuse of transport path suffixes. This framework provides maximum control of the sampling scheme by the programmer, which can be hard to achieve with Markov chain-based methods. We show that local QMC exploration can generate results on par with state of the art light transport sampling methods, while providing more uniform convergence, improving temporal consistency.