Rendering - Experimental Ideas & Implementations 2016

Permanent URI for this collection

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

Browse

Browsing Rendering - Experimental Ideas & Implementations 2016 by Subject "Visible line/surface algorithms"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Fast Shadow Map Rendering for Many-Lights Settings
    (The Eurographics Association, 2016) Selgrad, Kai; Müller, Jonas; Reintges, Christian; Stamminger, Marc; Elmar Eisemann and Eugene Fiume
    In this paper we present a method to efficiently cull large parts of a scene prior to shadow map computations for many-lights settings. Our method is agnostic to how the light sources are generated and thus works with any method of light distribution. Our approach is based on previous work in culling for ray traversal to speed up area light sampling. Applied to shadow mapping our method works for high- and low-resolution shadow maps and, in contrast to previous work on many-lights rendering, does neither entail scene approximations nor imposes limits on light range, while still providing significant gains in performance. In contrast to standard culling methods shadow map rendering itself is sped up by a factor of 1.5 to 8.6 while the speedup of shadow map rendering, lookup and shading together ranges from 1.1 to 4.2.
  • Thumbnail Image
    Item
    Node Culling Multi-Hit BVH Traversal
    (The Eurographics Association, 2016) Gribble, Christiaan; Elmar Eisemann and Eugene Fiume
    We introduce node culling multi-hit BVH traversal to enable faster multi-hit ray tracing in a bounding volume hierarchy (BVH). Existing, widely used ray tracing engines expose API features that enable implementation of multi-hit traversal without modifying their underlying-and highly optimized-BVH construction and traversal routines; however, this approach requires naive multi-hit traversal to guarantee correctness. We evaluate two low-overhead, minimally invasive, and flexible API mechanisms that enable node culling implementation entirely with user-level code, thereby leveraging existing BVH construction and traversal routines. Results show that node culling offers potentially significant improvement in multi-hit performance in a BVH for cases in which users request fewer-than-all hits.