Evaluating the visibility between two points is a fundamental problem for ray-tracing and path-tracing algorithms. Ideally, visibility computations are organized such that a minimum number of geometric primitives need to be checked for each ray. Replacing complex geometric shapes by a simpler set of primitives is one strategy to control the amount of intersection calculations. However, approximating the original geometry introduces inaccuracies in e.g. shadow regions when shadow rays are intersected with the approximate geometry. This paper presents a theoretical framework for probabilistic visibility evaluation. When intersecting a shadow ray with the scene, we randomly select the original geometry, the approximated geometry, or one of sev...
We propose an efficient approach to precompute and reuse visibility information based on existing sp...
This dissertation introduces the image generalization paradigm for computing visibility. The paradig...
We present a novel method to accelerate the computation of the visibility function of the lighting e...
Evaluating the visibility between two points is a fundamental problem for ray-tracing and path-traci...
Visibility evaluations between two points are a common operation in global illumination algorithms. ...
The efficient evaluation of visibility in a three-dimensional scene is a longstanding problem in com...
Evaluating the visibility between two points is a common task in global illumination algorithms. Tra...
The use of computer graphics has become commonplace in industry, games, films, architectural visuali...
Visibility testing is an integral part of many computer graphics algorithms. For example, algorithms...
International audienceWe present a new, fast algorithm for rendering physically-based soft shadows i...
International audienceVisibility problems are central to many computer graphics applications. The mo...
Visibility culling is a means of accelerating the graphical rendering of geometric models. Invisible...
Figure 1: Visualization of sampling strategies (white pixels show a subset of the actual samples, mi...
This paper addresses the problem of efficiently calculating shadows from environment maps. Since acc...
This paper addresses the problem of efficiently calculating shadows from environment maps in the con...
We propose an efficient approach to precompute and reuse visibility information based on existing sp...
This dissertation introduces the image generalization paradigm for computing visibility. The paradig...
We present a novel method to accelerate the computation of the visibility function of the lighting e...
Evaluating the visibility between two points is a fundamental problem for ray-tracing and path-traci...
Visibility evaluations between two points are a common operation in global illumination algorithms. ...
The efficient evaluation of visibility in a three-dimensional scene is a longstanding problem in com...
Evaluating the visibility between two points is a common task in global illumination algorithms. Tra...
The use of computer graphics has become commonplace in industry, games, films, architectural visuali...
Visibility testing is an integral part of many computer graphics algorithms. For example, algorithms...
International audienceWe present a new, fast algorithm for rendering physically-based soft shadows i...
International audienceVisibility problems are central to many computer graphics applications. The mo...
Visibility culling is a means of accelerating the graphical rendering of geometric models. Invisible...
Figure 1: Visualization of sampling strategies (white pixels show a subset of the actual samples, mi...
This paper addresses the problem of efficiently calculating shadows from environment maps. Since acc...
This paper addresses the problem of efficiently calculating shadows from environment maps in the con...
We propose an efficient approach to precompute and reuse visibility information based on existing sp...
This dissertation introduces the image generalization paradigm for computing visibility. The paradig...
We present a novel method to accelerate the computation of the visibility function of the lighting e...