Abstract
The radiosity method is a well-known global illumination algorithm for rendering scenes which produces highly realistic images. However, it is a computationally expensive method. In order to reduce the response time required for rendering a scene, a parallel version of a hierarchical radiosity algorithm has been developed, which takes profit of both shared and distributed memory architectures. The parallel code is used in an electronic commerce application and, therefore, the main focus is on achieving the fastest response rather than being able to render large scenes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Amor, E. J. Padrón, J. Touriño, and R. Doallo. Scheduling of a Hierarchical Radiosity Algorithm on a Distributed-Memory Multiprocessor. 4th International Meeting on Vector and Parallel Processing, 581–591, 2000.
M. Cohen, S. E. Chen, J. R. Wallace and D. P. Greenberg. Progressive Refinement Approach for Fast Radiosity Image Generation. Computer Graphics (SIGGRAPH’ 88 Proceedings), 22(4):31–40, 1988. 528
Chen-Chin Feng and Shi-Nine Yang. A parallel hierarchical radiosity algorithm for complex scenes IEEE Parallel Rendering Symposium, 71–78, November 1997. 530
James D. Foley, Andries van Dam, Steven K. Feiner and John F. Hughes. Computer Graphics: Principles and Practice. 2nd ed. Addison-Wesley, 1996. 523
T. Funkhouser. Coarse-Grained Parallelism for Hierarchical Radiosity Using Group Iterative Methods. Computer Graphics (SIGGRAPH 96), August 1996. 530
Chao-Yang Gau and Mark A. Stadtherr. Parallel branch-and-bound for chemical engineering applications: Load balancing and scheduling issues (invited talk). Lecture Notes in Computer Science, 1981:273–300, 2001. 531
S. Gibson, R. J. Hubbold. A perceptually-driven parallel algorithm for efficient radiosity simulation. IEEE Trans. on Visualisation and Computer Graphics, 6(3):220–235, 2000.
Cindy M. Goral, Kenneth K. Torrance, Donald P. Greenberg, and Bennett Battaile. Modelling the interaction of light between diffuse surfaces. Computer Graphics, 18(3):213–222, July 1984. 523
P. Hanrahan, D. Salzman and L. Aupperle. A Rapid Hierarchical Radiosity Algorithm. Computer Graphics, 25(4):197–206, 1991. 528
Reinhard Lüling and Olaf Schmidt. Hipec: High performance computing visualization system supporting networked electronic commerce applications. Lecture Notes in Computer Science, 1470:1149–1152, 1998. 525
D. Meneveaux K. Bouatouch. Synchronization and load balancing for parallel hierarchical radiosity of complex scenes. Computer Graphics Forum, 18(4):201–212, 1999.
Luc Renambot, Bruno Arnaldi, Thierry Priol and Xavier Pueyo. Towards efficient parallel radiosity for DSM-based parallel computers using virtual interfaces. IEEE Parallel Rendering Symposium, 79–86, November 1997. 530
Francois Sillion and J.-M. Hasenfratz. Efficient Parallel Refinement for Hierarchical Radiosity on a DSM Computer. Proceedings of the Third Eurographics Workshop on Parallel Graphics and Visualisation, September 2000. 532
Marc Snir, Steve Otto, Steven Huss-Lederman, David Walker and Jack Dongarra. MPI: The Complete Reference The MIT Press, 1996. 531
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caballer, M., Guerrero, D., Hernández, V., Román, J.E. (2003). A Parallel Rendering Algorithm Based on Hierarchical Radiosity. In: Palma, J.M.L.M., Sousa, A.A., Dongarra, J., Hernández, V. (eds) High Performance Computing for Computational Science — VECPAR 2002. VECPAR 2002. Lecture Notes in Computer Science, vol 2565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36569-9_35
Download citation
DOI: https://doi.org/10.1007/3-540-36569-9_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00852-1
Online ISBN: 978-3-540-36569-3
eBook Packages: Springer Book Archive