The paper presents a combined finite element and quasi-random walk method to solve the general rendering equation. Applying finite element techniques, the surfaces are decomposed into planar patches that are assumed to have position independent, but not direction independent (that is non-diffuse) radiance. The direction dependent radiance function is then computed by quasi-random walk. Since quasi-Monte Carlo quadrature is applied here to an integrand of finite variation, this method can take advantage of the superior convergence of quasi-Monte Carlo integration.

finite number of unknown directional radiance functions by predefined positional basis functions. The directional radiance functions are then computed by random walk or by stochastic iteration using bundles of parallel rays. To compute the radiance transfer in a single direction, several global

, but not direction independent radiance. The direction dependent radiance function is then computed by random walk using bundles of parallel rays. In a single step of the walk, the radiance transfer is evaluated exploiting the hardware z-buffer of workstations, making the calculation fast. The proposed method

. On the other hand, GPUs can make the most of their computing power if the problem can be broken down into many parallel, small tasks. Casting global, parallel ray-bundles into the scene is a way of achieving this parallelism. We exploit modern GPU features to extract all intersection points along each ray

Introduction A bidirectional sampling method with raybundles [TO12] enables high-quality global illumination, but computation time of ray-bundles depends on the number of sample directions and the number of primitives. This poster proposes an approximate ray-bundle tracing based on imperfect

A bidirectional sampling method with ray-bundles [TO12] enables high-one-bounce three-bounce

. Ideal mirrors and refracting objects cannot be rendered with these methods. 2. Recursive ray-tracing Another alternative is to eliminate from the rendering equation those energy contributions which cause the difficulties, and thus give ourselves a simpler problem to solve. For example, if limited level

○GeForce R○GTX 580). This paper proposes an adaptive rendering technique for ray-bundle tracing. Ray-bundle tracing can be done by per-pixel linked-list construction on a GPU rasterization pipeline. This rasterization based approach offers significant benefits for the efficient generation of light maps (e

The paper presents an efficient method to solve the general rendering equation, using a combined finite element and quasi-random walk approach. Applying finite element techniques, the surfaces are decomposed into planar patches that are assumed to have position independent, but not direction independent (that is non-diffuse) radiance. The direction dependent radiance function is then computed by quasi-random walk. Since quasi-Monte Carlo quadrature is applied here to an integrand of finite variation, this method can take advantage of the superior convergence of quasi-Monte Carlo integration.

and designs for a suitable ray tracing API. The third part of this STAR then builds on top of these techniques by presenting algorithms for interactive global illumination in complex and dynamic scenes that may contain large numbers of light sources. We believe that the improved quality and the increased