A Ray tracing algorithm for progressive radiosity
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Improving interaction with radiosity-based lighting simulation programs
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
Acceleration techniques for progressive refinement radiosity
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
Real time radiosity through parallel processing and hardware acceleration
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
A rapid hierarchical radiosity algorithm
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Precision requirements for digital color reproduction
ACM Transactions on Graphics (TOG)
Radiosity and realistic image synthesis
Radiosity and realistic image synthesis
Global visibility algorithms for illumination computations
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
A clustering algorithm for radiosity in complex environments
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Portals and mirrors: simple, fast evaluation of potentially visible sets
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
A model of visual adaptation for realistic image synthesis
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Coarse-grained parallelism for hierarchical radiosity using group iterative methods
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
The SGI Origin: a ccNUMA highly scalable server
Proceedings of the 24th annual international symposium on Computer architecture
Towards efficient parallel radiosity for DSM-based parallel computers using virtual interfaces
PRS '97 Proceedings of the IEEE symposium on Parallel rendering
A perceptually based physical error metric for realistic image synthesis
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Multidimensional binary search trees used for associative searching
Communications of the ACM
A progressive refinement approach to fast radiosity image generation
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Radiosity and Global Illumination
Radiosity and Global Illumination
Perceptually-informed accelerated rendering of high quality walkthrough sequences
EGWR'99 Proceedings of the 10th Eurographics conference on Rendering
Visual attention based information culling for Distributed Virtual Environments
Proceedings of the ACM symposium on Virtual reality software and technology
PHR: A Parallel Hierarchical Radiosity System with Dynamic Load Balancing
The Journal of Supercomputing
Progressive radiosity method on clusters using a new clipping algorithm
International Journal of High Performance Computing and Networking
A parallel rendering algorithm based on hierarchical radiosity
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
A high-performance progressive radiosity method based on scene partitioning
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Parallel Monte Carlo radiosity using scene partitioning
International Journal of High Performance Computing Applications
| Hi-index | 0.00 |
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.