Global illumination provides realistic image synthesis but its high computational requirements limit its use in practice. In this paper we present a parallel method of the Monte Carlo radiosity method. Our proposal is based on the utilization of a convex partition to divide the whole scene into a set of disjoint sub-scenes which are allocated among processors of a distributed memory system. We have used two partitioning strategies: uniform and non-uniform. The convex partition employed permits the exploitation of data locality, and the optimization of the ray shooting procedure by minimizing the number of objects to be tested in the intersection calculation. We present three different techniques to increase the performance of parallel implementation and to solve the challenges that the distribution of the data among processors implies: minimization of communications, load balancing, and a distributed test for determining the end of each iteration. The obtained results are good in terms of quality and execution times, increasing the flexibility of previous solutions.
AlmeHRodriguezGZimmermanG (2001) Domain decomposition models for parallel monte carlo transport. The Journal of Supercomputing18: 5–23.
2.
AmorMSanjurjoJRPadrónEJDoalloR (2004) Progressive radiosity method on clusters using a new clipping algorithm. International Journal of High Performance Computing and Networking1: 55–63.
3.
BekaertPNeumannLNeumannASbertMWillemsYD (1998) Hierarchical Monte Carlo radiosity. In: Rendering Techniques’98, Proceedings of the Eurographics Workshop. New York: Springer, pp. 259–268.
4.
BenthinCWaldIScherbaumMFriedrichH (2006) Ray tracing on the Cell processor. In: Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing, pp. 15–23.
5.
BrunnerTBrantleyPS (2009) An efficient, robust, domain-decomposition algorithm for Monte Carlo. Journal of Computational Physics228: 3882–3890.
DutrePBekaertPBalaK (2006) Advanced Global Illumination, 2nd edn. Wellesley, MA: A.K. Peters Limited.
8.
GibsonSHubboldRJ (2000) A perceptually-driven parallel algorithm for efficient radiosity simulation. IEEE Transactions on Visualization and Computer Graphics6: 220–235.
9.
HavranV (2000) Heuristic Ray Shooting Algorithms. Ph.D. thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague.
10.
IzeTBrownleeCHansenCD (2011) Real-time ray tracer for visualizing massive models on a cluster. In: Proceedings of Eurographics Symposium on Parallel Graphics and Visualization, EGPGV 2011, pp. 61–69.
11.
JensenHW (2001) Realistic Image Synthesis Using Photon Mapping. Wellesly, MA: A.K. Peters Limited.
12.
KalosMHWhitlockPA (1986) Monte Carlo Methods. New York: Wiley-Interscience.
13.
KaplanyanADachsbacherC (2010) Cascaded light propagation volumes for real-time indirect illumination. In: Proceedings of the 2010 ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D’10). New York: ACM Press, pp. 99–107.
14.
KatoT (2003) ‘Kilauea’: parallel global illumination renderer. Parallel Computing29: 289–310.
15.
LarsenBDChristensenNJ (2004) Simulating photon mapping for real-time applications. In Rendering Techniques ‘04, pp. 123–132.
16.
NeumannLPurgathoferWToblerRF. (1995) The stochastic ray method for radiosity. In: Rendering Techniques ‘95, pp. 206–218.
17.
PharrMHumphreysG (2004) Physically Based Rendering: From Theory to Implementation. San Mateo, CA: Morgan Kaufmann Publishers Inc.
18.
PopovSGüntherJSeidelH-PSlusallekP (2007) Stackless -tree traversal for high performance GPU ray tracing. Computer Graphics Forum26: 415–424.
19.
RitschelTGroschTKimMHSeidelH-PDachsbacherCKautzJ (2008) Imperfect shadow maps for efficient computation of indirect illumination. ACM Transaction on Graphics27: 129:1–129:8.
20.
SanjurjoJRAmorMBóoMDoalloR (2005) Parallel global illumination method based on a non-uniform partitioning of the scene. In: Proceedings of the 13th Euromicro Conference on Parallel, Distributed and Network-based Processing (PDP’05), pp. 251–257.
21.
SanjurjoJRAmorMBóoMDoalloR (2007) Improving locality for progressive radiosity algorithm: a study based on the blocking transformation of the scene. In: Proceedings of the 15th International Conference in Central Europe on Computer Graphics, Visualization, and Computer Vision’2007 (WSCG07), pp. 113–120.
22.
SbertM (1997) Error and complexity of random walk Monte Carlo radiosity. IEEE Transactions on Visualization and Computer Graphics3: 23–38.
23.
SchloegelKKarypisGKumarV (2003) Graph partitioning for high-performance scientific simulations. Sourcebook of Parallel Computing. San Francisco, CA: Morgan Kaufmann Publishers Inc., pp. 491–541.
24.
ShevtsovMSoupikovAKapustinA (2007) Highly parallel fast -tree construction for interactive ray tracing of dynamic scenes. Computer Graphics Forum26: 395–404.
25.
WaldIBenthinCDietrichASlusallekP (2003) Interactive Distributed Ray Tracing on Commodity PC Clusters – State of the Art and Practical Applications (Lecture Notes on Computer Science, vol. 2790). Berlin: Springer, pp. 499–508.
26.
WaldIBenthinCWagnerMSlusallekP (2001) Interactive rendering with coherent ray tracing. Computer Graphics Forum (Proceedings of EUROGRAPHICS 2001)20: 153–164.
27.
WaldIDietrichASlusallekP (2005) An interactive out-of-core rendering framework for visualizing massively complex models. In: ACM SIGGRAPH 2005 Courses.
28.
WangRWangRZhouKPanMBaoH (2009) An efficient GPU-based approach for interactive global illumination. ACM Transactions on Graphics28(3): 91:1–91:8.
29.
WoopSSchmitterJSlusallekP (2005) RPU: a programmable ray processing unit for realtime ray tracing. ACM Transactions on Graphics24: 434–444.
30.
ZareskiDWadeBHubbardPShirleyP (1995) Efficient parallel global illumination using density estimation. In: Proceedings of the IEEE Symposium on Parallel Rendering (PRS’95), pp. 47–54.
