This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Perceptually-Driven Parallel Algorithm for Efficient Radiosity Simulation
July-September 2000 (vol. 6 no. 3)
pp. 220-235
ASCII Text
x 
 
Simon Gibson, Roger J. Hubbold, "A Perceptually-Driven Parallel Algorithm for Efficient Radiosity Simulation," IEEE Transactions on Visualization and Computer Graphics, vol. 6, no. 3, pp. 220-235, July-September, 2000.
 
 
BibTex
x
 
@article{ 10.1109/2945.879784,
author = {Simon Gibson and Roger J. Hubbold},
title = {A Perceptually-Driven Parallel Algorithm for Efficient Radiosity Simulation},
journal ={IEEE Transactions on Visualization and Computer Graphics},
volume = {6},
number = {3},
issn = {1077-2626},
year = {2000},
pages = {220-235},
doi = {http://doi.ieeecomputersociety.org/10.1109/2945.879784},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Visualization and Computer Graphics
TI - A Perceptually-Driven Parallel Algorithm for Efficient Radiosity Simulation
IS - 3
SN - 1077-2626
SP220
EP235
EPD - 220-235
A1 - Simon Gibson,
A1 - Roger J. Hubbold,
PY - 2000
KW - Radiosity
KW - progressive refinement
KW - parallelism
KW - distributed shared memory
KW - load balancing
KW - tone reproduction
KW - visibility.
VL - 6
JA - IEEE Transactions on Visualization and Computer Graphics
ER -
 

Abstract—We describe a novel algorithm for computing view-independent finite-element radiosity solutions on distributed shared-memory parallel architectures. Our approach is based on the notion of a subiteration being the transfer of energy from a single source to a subset of the scene's receiver patches. By using an efficient queue-based scheduling system to process these subiterations, we show how radiosity solutions can be generated without the need for processor synchronization between iterations of the progressive refinement algorithm. The only significant source of interprocessor communication required by our method is for visibility calculations. We also describe a perceptually-driven approach to visibility estimation, which employs an efficient volumetric grid structure and attempts to reduce the amount of interprocessor communication by approximating visibility queries between distant patches. Our algorithm also eliminates the need for dynamic load-balancing until the end of the solution process and is shown to achieve a super-linear speedup in many situations.

[1] M.F. Cohen, D.P. Greenberg, D.S. Immel, and P.J. Brock, “An Efficient Radiosity Approach for Realistic Image Synthesis,” IEEE Computer Graphics and Applications, vol. 6, no. 3, pp. 26-35, Mar. 1986.
[2] M.F. Cohen, S.E. Chen, J.R. Wallace, and D.P. Greenberg, "A Progressive Refinement Approach to Fast Radiosity Image Generation," Proc. SIGGRAPH 88, pp. 75-84, 1988.
[3] P. Hanrahan, D. Saltzman, and L. Aupperle, "A Rapid Hierarchical Radiosity Algorithm," Computer Graphics, SIGGRAPH '91,Las Vegas, vol. 25, no. 4, pp. 197-206, Aug. 1991.
[4] F.X. Sillion, “Clustering and Volume Scattering for Hierarchical Radiosity Calculations,” Proc. Fifth Eurographics Workshop Rendering, pp. 105-117, June 1994.
[5] B. Smits, J. Arvo, and D. Greenberg, “A Clustering Algorithm for Radiosity in Complex Environments,” Computer Graphics Proc., Ann. Conf. Series (ACM SIGGRAPH '94 Proc.), pp. 435-442, 1994.
[6] S. Gibson and R.J. Hubbold, “Efficient Hierarchical Refinement and Clustering for Radiosity in Complex Environments,” Computer Graphics Forum, vol. 15, no. 5, pp. 297-310, Dec. 1996.
[7] M. Stamminger, P. Susallek, and H.P. Seidel, “Bounded Clustering—Finding Good Bounds on Clustered Light Transport,” Technical Report TR-97-1, Universität Erlangen, IMMD 9, 1997.
[8] D.R. Baum and J.M. Winget, “Real Time Radiosity through Parallel Processing and Hardware Acceleration,” Computer Graphics (1990 Symp. Interactive 3D Graphics), vol. 24, no. 2, pp. 67-75, Mar. 1990.
[9] K. Bouatouch, D. Menard, and T. Priol, “Parallel Radiosity Using a Shared Virtual Memory,” Proc. First Bilkent Computer Graphics Convergence on Advanced Techniques in Animation, Rendering and Visualisation, July 1993.
[10] J.P. Singh, A. Gupta, and M. Levoy, "Parallel Visualization Algorithms: Performance and Architectural Implications," Computer, Vol. 27, No. 7, July 1994, pp. 45-55.
[11] T.A. Funkhouser, “Coarse-Grained Parallelism for Hierarchical Radiosity Using Group Iterative Methods,” Computer Graphics Proc., Ann. Conference Series, 1996 (ACM SIGGRAPH '96 Proc.), pp. 343-352, 1996.
[12] L. Renambot, B. Arnaldi, T. Priol, and X. Pueyo, “Towards Efficient Parallel Radiosity for DSM-Based Parallel Computers Using Virtual Interfaces,” Proc. Third Parallel Rendering Symp., Oct. 1997.
[13] M.F. Cohen and J.R. Wallace, Radiosity and Realistic Image Synthesis. Academic Press, 1993.
[14] F.X. Sillion and C. Puech, Radiosity and Global Illumination. San Francisco: Morgan Kaufmann, 1994.
[15] J. Laudon and D. Lenoski, "The SGI Origin: A cc-NUMA Highly Scalable Server," Proc. 24th Ann. Int'l Symp. Computer Architecture, May 1997.
[16] S. Gibson and R.J. Hubbold, “Perceptually-Driven Radiosity,” Computer Graphics Forum, vol. 16, no. 2, pp. 129-140, June 1997.
[17] S. Gibson, “Efficient Radiosity Simulation Using Perceptual Metrics and Parallel Processing,” Technical Report UMCS-99-9-1, Dept. of Computer Science, Univ. of Manchester, Manchester, U.K., Sept. 1999.
[18] J. Wallace,K. Elmquist,, and E. Haines,“A ray tracing algorithm for progressive radiosity,” Computer Graphics, vol. 23, no. 3, Siggraph’89 proc. pp. 315-324, 1989.
[19] S.E. Chen, “A Progressive Radiosity Method and Its Implementation in a Distributed Processing Environment,” MSc thesis, Program of Computer Graphics, Cornell Univ., Ithaca, N.Y., Jan. 1989.
[20] R. Recker,D. George,, and D. Greenberg,“Acceleration techniques for progressive refinement radiosity,” Computer Graphics, vol. 24, no. 2, pp. 59-66, Mar. 1990.
[21] C. Puech, F. Sillion, and C. Vedel, “Improving Interaction with Radiosity-based Lighting Simulation Programs,” Computer Graphics, Vol. 24, No. 2, Mar. 1990, pp. 51-57.
[22] L. Sindlar, “Parallel Radiosity on a Cluster of Workstations,” Proc. Winter School of Computer Graphics '96, 1996.
[23] A.G. Chalmers and D.J. Paddon, “Parallel Processing of Progressive Refinement Radiosity Methods,” Proc. Second Eurographics Workshop Rendering, pp. 149-159, May 1991.
[24] L. Renambot and D. Figuls, “Convergence Analysis in a Parallel Radiosity Algorithm Using Virtual Interface,” Proc. Second Eurographics Workshop ParallelGraphics and Visualisation, pp. 31-48, Sept. 1998.
[25] B. Arnaldi, T. Priol, L. Renambot, and X. Pueyo, “Visibility Masks for Solving Complex Radiosity Computations on Multiprocessors,” Proc. First Eurographics Workshop Parallel Graphics and Visualisation, pp. 219-232, Sept. 1996.
[26] K. Myszkowski, “The Visible Differences Predictor: Applications to Global Illumination Problems,” Rendering Techniques '98 (Proc. Eurographics Rendering Workshop '98), G. Drettakis and N. Max, eds., pp. 233-236, 1998.
[27] K. Myszkowski, P. Rokita, and T. Tawara, “Perceptually-Informed Accelerated Rendering of High-Quality Walkthrough Sequences,” Rendering Techniques '99 (Proc. Eurographics Rendering Workshop '99), June 1999.
[28] M. Ramasubramanian, S.N. Pattanaik, and D.P. Greenberg, "A Perceptually Based Physical Error Metric for Realistic Image Synthesis," Computer Graphics(Proc. Siggraph 99), ACM Press, New York, Aug. 1999, vol. 33, pp. 73-82.
[29] J.L. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, no. 9, pp. 509-517, 1975.
[30] J. Fier, Performance Tuning Optimization for Origin2000 and Onyx2, Number 007-3430-001, Silicon Graphics Inc.,http://www.kitware.com/vtk.htmlhttp://techpubs.sgi. com library, 1996.
[31] D. Jevans and B. Wyvill, “Adaptive Voxel Subdivision for Ray Tracing,” Proc. Graphics Interface '89, pp. 164-172, June 1989.
[32] J. Ferwerda, S. Pattanaik, P. Shirley, and D.P. Greenberg, "A Model of Visual Adaptation for Realistic Image Synthesis," Proc. ACM SIGGRAPH '96, p. 249-258, 1996.
[33] CIE, “CIE Recommendations on Uniform Color Spaces,” Color-Difference Equations and Psychometric Color Terms, Bureau de la CIE, Paris, 1978.
[34] M. Stokes, M.D. Fairchild, and R.S. Berns, “Precision Requirements for Digital Color Reproduction,” ACM Trans. Graphics, vol. 11, no. 4, pp. 406-422, Oct. 1990.
[35] P.G.J. Barton, “Evaluation of Subjective Image Quality with the Square-Root Integral Method,” J. Optical Soc. Am. (Optics and Image Science), vol. 7, no. 10, pp. 2,024-2,031, 1990.
[36] J. Gustafson, “Fixed Time, Tiered Memory, and Superlinear Speedup,” Proc. Fifth Distributed Memory Computing Conf. (DMCC5), Oct. 1990.
[37] S.J. Teller and P. Hanrahan, "Global Visibility Algorithms for Illumination Computations," Proc. Conf. SIGGRAPH '93, pp. 239-246,Anaheim, Calif., ACM Computer Graphics Ann. Conf. Series, Aug. 1993, .
[38] D. Luebke and C. Georges, "Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets," Proc. 1995 Symp. Interactive 3D Graphics, pp. 105-106, 1995.

Index Terms:
Radiosity, progressive refinement, parallelism, distributed shared memory, load balancing, tone reproduction, visibility.
Citation:
Simon Gibson, Roger J. Hubbold, "A Perceptually-Driven Parallel Algorithm for Efficient Radiosity Simulation," IEEE Transactions on Visualization and Computer Graphics, vol. 6, no. 3, pp. 220-235, July-Sept. 2000, doi:10.1109/2945.879784
Usage of this product signifies your acceptance of the Terms of Use.