VMV2020

Permanent URI for this collection

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

Browse

Browsing VMV2020 by Subject "Ray tracing"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Multi-Layer Alpha Tracing
    (The Eurographics Association, 2020) Brüll, Felix; Grosch, Thorsten; Krüger, Jens and Niessner, Matthias and Stückler, Jörg
    Rendering many transparent surfaces in real-time is still an open problem. We introduce two techniques for fast transparency rendering with ray tracing hardware, one being exact and the other being approximate but of high quality. Our approximate technique is called Multi-Layer Alpha Tracing, operates in bounded memory and is up to 60% faster than naive ray traversal. It outperforms existing rasterization techniques in terms of image quality and performance while maintaining a small memory footprint. It can also be used to accelerate ray tracing of transparent objects for the reflected rays.
  • Thumbnail Image
    Item
    Portal-Based Path Perturbation for Metropolis Light Transport
    (The Eurographics Association, 2020) Otsu, Hisanari; Hanika, Johannes; Dachsbacher, Carsten; Krüger, Jens and Niessner, Matthias and Stückler, Jörg
    Light transport simulation in scenes with difficult visibility still remains a challenging problem. Markov chain Monte Carlo (MCMC) rendering is often employed for such configurations. It generates a sequence of correlated light transport paths by iteratively mutating the current state, a path, to another. Since the proposed path is correlated to the current path, MCMC can explore regions of the path space, also with difficult visibility, once they have been found. To improve the efficiency of the exploration, we propose a path mutation strategy making use of the concept of portals. Portals are user-defined objects in the scene to guide the sampling of the difficult visibility, which have been employed in the context of non-MCMC rendering. Our mutation strategy perturbs a path edge around the intersection point of the edge and the portal, instead of perturbing the edge by moving a path vertex as in the ordinary path mutation strategies. This reduces the probability for the proposed path being rejected due to changes in visibility.