P. Slusallek, M. Stamminger, W. Heidrich, J.-C. Popp, and H.-P. Seidel. Composite lighting simulations with lighting network. IEEE Computer Graphics and Applications, 18(2):22--31, /1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a clever mapping of hierarchical radiosity to highdimensional spaces as presented in this paper manifests a locality property, which can greatly reduce communication. Recently there are trends to integrate both Finite Element and Monte Carlo approaches into a single global illumination framework [19]. We searched for a parallel solution of the HRA that is well adaptable also to particle based global illumination algorithms. We encountered dynamic spatial partitioning strategies, which seem to be perfect candidates. As a general tool spatial partitioning can be applied to any application ....

....and links across local memories. The advantages of spatial partitioning are as follows. The method can easily be extended to Monte Carlo rendering algorithms (in fact spatial partitioners have been used already for raytracing algorithms [4, 23] Hence, the parallelization of hybrid methods as in [19] should be easier with spatial partitioning. Spatial partitioning is robust and has been shown to be efficient even in the theoretical worst case. And, last but not least, the speedup plots in this paper manifest the practical usefulness of this method for hierarchical radiosity. There are three ....

P. Slusallek, M. Stamminger, W. Heidrich, J.-C. Popp, and H.-P. Seidel. Composite lighting simulations with lighting networks. IEEE CG&A, March/April 1998.

....a clever mapping of hierarchical radiosity to high dimensional spaces as presented in this paper manifests a locality property, which can greatly reduce communication. Recently there are trends to integrate both Finite Element and MonteCarlo approaches into a single global illumination framework [17]. We searched for a parallel solution of the HRA that is well adaptable also to particle based global illumination algorithms. We encountered dynamic spatial partitioning strategies, which seem to be perfect candidates. As a general tool spatial partitioning can be applied to any application ....

P. Slusallek, M. Stamminger, W. Heidrich, J.-C. Popp, and H.-P. Seidel. Composite lighting simulations with lighting networks. IEEE CG&A, March/April 1998.

....by first generating a global illumination solution for the lamp geometry, and then rendering it from multiple points of view on the (u, v) plane. For the global illumination step, we can use any kind of algorithm, such as radiosity, Monte Carlo raytracing, Photon Maps, or composite methods [13]. Alternatively, Canned Lightsources could be generated by resampling measured data [2] much in the same way described in [6] Finally, it is also possible to generate non physical lightsources for special effects. One issue is the storage of Canned Lightsources. Due to the large dynamic range ....

P. Slusallek, M. Stamminger, W. Heidrich, J.-C. Popp, and H.-P. Seidel. Composite lighting simulations with lighting networks. IEEE Computer Graphics and Applications, 18(2):22-- 31, March 1998.

....our current tool box of light propagation and conversion algorithms. 2 Lighting Networks We start our presentation with a brief description of the basic Lighting Network approach. A more detailed description including extensions and a more formal definition of Lighting Networks can be found in [20]. 2.1 Lighting Operators The basic idea of the Lighting Network approach is to split the computation of global illumination into separate steps. In each step, one algorithm performs a part of the whole simulation process. Each algorithm receives a description of illumination in the scene as ....

....some preprocessing of their input data before individual requests can be processed. Examples of such processing are the solution of a finite element system or the initial tracing of photons from light sources. This kind of preprocessing is performed by a special recursive preprocessing request [20]. 2.5 More Flexibility While this idea of a network of algorithms may seem like an unnecessary complication compared to a single multipass algorithm, it offers a lot of flexibility that we are going to use to our advantage. This added flexibility may also be directly exploited by a user of a ....

[Article contains additional citation context not shown here]

Philipp Slusallek, Marc Stamminger, Wolfgang Heidrich, Jan-Chrisitan Popp, and Hans-Peter Seidel. Composite lighting simulations with lighting networks. IEEE Computer Graphics and Applications, 18(2):22--31, March 1998.

....by first generating a global illumination solution for the lamp geometry, and then rendering it from multiple points of view on the (u; v) plane. For the global illumination step, we can use any kind of algorithm, such as radiosity, Monte Carlo raytracing, Photon Maps, or composite methods [13]. Alternatively, Canned Lightsources could be generated by resampling measured data [2] much in the same way described in [6] Finally, it is also possible to generate non physical lightsources for special effects. One issue is the storage of Canned Lightsources. Due to the large dynamic range ....

P. Slusallek, M. Stamminger, W. Heidrich, J.-C. Popp, and H.-P. Seidel. Composite lighting simulations with lighting networks. IEEE Computer Graphics and Applications, 18(2):22-- 31, March 1998.

No context found.

P. Slusallek, M. Stamminger, W. Heidrich, J.-C. Popp, and H.-P. Seidel. Composite lighting simulations with lighting network. IEEE Computer Graphics and Applications, 18(2):22--31, /1998.

No context found.

P. Slusallek, M. Stamminger, W. Heidrich, J.-C. Popp, , and H.-P. Seidel, "Composite lighting simulations with lighting networks", IEEE Computer Graphics and Applications, 18(2), pp. 22--31 (1998).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC