We propose an efficient approach to precompute and reuse visibility information based on existing spatial data structures by using a precomputed data structure: the line space. This data structure provides an additional skip condition by checking whether the subnodes in a hierarchical spatial data structures need to check for intersection with the ray. We evaluate this method on different test scenes and show that it is able to achieve a remarkable speed-up by using this skip condition. Furthermore we describe algorithms for fast set-up and traversal in detail and discuss important strategies for this approach
In this paper we address the problem of fast construction of spatial hierarchies for ray tracing wit...
This artifacts contains a Docker image, in which the simulator used in our MICRO 2021 conference pap...
In this paper we address the problem of fast construction of spatial hierarchies for ray tracing wit...
We propose an efficient approach to precompute and reuse visibility information based on existing sp...
Evaluating the visibility between two points is a common task in global illumination algorithms. Tra...
textModern rendering systems require fast and efficient acceleration structures in order to compute ...
Shadows are one of the most important effects to create realism in rendering. Most real-time applica...
This paper describes algorithmic procedures that have been implemented to reduce the computational e...
We consider the efficient top-down construction of spatial hierarchies for accel-erating ray tracing...
Efficient ray tracing for rendering needs to minimize the number of redundant intersection tests bet...
Goal of this work is to write an optimized program for visualization of 3D scenes using ray tracing ...
Commonly used hierarchical data structures such as bounding volume hierarchies and kd-trees have rat...
In this paper we apply a run--based ray--traversal algorithm to accelerate the ray tracing of height...
Ray tracing is a computer graphics technique for generating photo-realistic images. To determine the...
We introduce a new ray tracing algorithm that exploits the best of previous methods: Similar to boun...
In this paper we address the problem of fast construction of spatial hierarchies for ray tracing wit...
This artifacts contains a Docker image, in which the simulator used in our MICRO 2021 conference pap...
In this paper we address the problem of fast construction of spatial hierarchies for ray tracing wit...
We propose an efficient approach to precompute and reuse visibility information based on existing sp...
Evaluating the visibility between two points is a common task in global illumination algorithms. Tra...
textModern rendering systems require fast and efficient acceleration structures in order to compute ...
Shadows are one of the most important effects to create realism in rendering. Most real-time applica...
This paper describes algorithmic procedures that have been implemented to reduce the computational e...
We consider the efficient top-down construction of spatial hierarchies for accel-erating ray tracing...
Efficient ray tracing for rendering needs to minimize the number of redundant intersection tests bet...
Goal of this work is to write an optimized program for visualization of 3D scenes using ray tracing ...
Commonly used hierarchical data structures such as bounding volume hierarchies and kd-trees have rat...
In this paper we apply a run--based ray--traversal algorithm to accelerate the ray tracing of height...
Ray tracing is a computer graphics technique for generating photo-realistic images. To determine the...
We introduce a new ray tracing algorithm that exploits the best of previous methods: Similar to boun...
In this paper we address the problem of fast construction of spatial hierarchies for ray tracing wit...
This artifacts contains a Docker image, in which the simulator used in our MICRO 2021 conference pap...
In this paper we address the problem of fast construction of spatial hierarchies for ray tracing wit...